AStarDijkstra< GraphType > Class Template Reference
The A* Variant of Dijkstra's algorithm using cartesian distances.
More...
#include <aStarDijkstra.h>
List of all members.
Public Member Functions |
| | AStarDijkstra (GraphType &graph, unsigned int *timestamp) |
| | Constructor.
|
| bool | hasFeasiblePotentials (const typename GraphType::NodeIterator &t) |
| | Checks if the graph has feasible potentials.
|
| WeightType | runQuery (const typename GraphType::NodeIterator &s, const typename GraphType::NodeIterator &t) |
| | Runs a shortest path query between a source node s and a target node t.
|
Detailed Description
template<class GraphType>
class AStarDijkstra< GraphType >
The A* Variant of Dijkstra's algorithm using cartesian distances.
This class supports running queries between source and target nodes
- Template Parameters:
-
| GraphType | The type of the graph to run the algorithm on |
- Author:
- Panos Michail
Constructor & Destructor Documentation
template<class GraphType >
Constructor.
- Parameters:
-
| graph | The graph to run the algorithm on |
| timestamp | An address containing a timestamp. A timestamp must be given in order to check whether a node is visited or not |
Member Function Documentation
template<class GraphType >
| bool AStarDijkstra< GraphType >::hasFeasiblePotentials |
( |
const typename GraphType::NodeIterator & |
t |
) |
[inline] |
Checks if the graph has feasible potentials.
- Parameters:
-
- Returns:
- True if the potentials are feasible, false otherwise
template<class GraphType >
| WeightType AStarDijkstra< GraphType >::runQuery |
( |
const typename GraphType::NodeIterator & |
s, |
|
|
const typename GraphType::NodeIterator & |
t | |
|
) |
| | [inline] |
Runs a shortest path query between a source node s and a target node t.
- Parameters:
-
| s | The source node |
| t | The target node |
- Returns:
- The distance of the target node
The documentation for this class was generated from the following file:
