OdinAI
|
#include <DijkstraGraphSearch.h>
Public Member Functions | |
Graph_SearchDijkstra (const graph_type &graph, int source, int target=-1) | |
std::vector< const Edge * > | GetSPT () const |
std::list< int > | GetPath () const |
double | GetCostToTarget () const |
double | GetCostToNode (unsigned int nd) const |
Given a graph, and an optional target, it calculates the shortest path from the source node to the target. The target maybe anything, it maybe a node, or it maybe a condition.
std::list<int> OdinAI::GraphSearchDijkstra< GraphType, TargetCondition >::GetPath | ( | ) | const |
Get the path. The list is empty if no path found.
|
inline |
Get our shortest path tree.