OdinAI
 All Classes Namespaces Functions Variables
OdinAI::GraphSearchDijkstra< GraphType, TargetCondition > Class Template Reference

#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
 

Detailed Description

template<class GraphType, class TargetCondition>
class OdinAI::GraphSearchDijkstra< GraphType, TargetCondition >

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.

Member Function Documentation

template<class GraphType , class TargetCondition >
std::list<int> OdinAI::GraphSearchDijkstra< GraphType, TargetCondition >::GetPath ( ) const

Get the path. The list is empty if no path found.

template<class GraphType , class TargetCondition >
std::vector<const Edge*> OdinAI::GraphSearchDijkstra< GraphType, TargetCondition >::GetSPT ( ) const
inline

Get our shortest path tree.


The documentation for this class was generated from the following file: