OdinAI

- Main Page
- Namespaces
- Classes
- Files

- Class List
- Class Index
- Class Hierarchy
- Class Members

All Classes Namespaces Functions Variables
Public Member Functions | List of all members
Graph_SearchDijkstra< 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 Graph_SearchDijkstra< 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> Graph_SearchDijkstra< GraphType, TargetCondition >::GetPath | ( |  | ) | const

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

template<class GraphType , class TargetCondition >

std::vector<const Edge*> Graph_SearchDijkstra< GraphType, TargetCondition >::GetSPT | ( |  | ) | const
| inline

Get our shortest path tree.

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

- Include/OdinAI/DijkstraGraphSearch.h