Named parameter for setting heap and cross reference types with automatic allocation. They should have standard constructor interfaces to be able to automatically created by the algorithm (i.e. the digraph should be passed to the constructor of the cross reference and the cross reference should be passed to the constructor of the heap). However external heap and cross reference objects could also be passed to the algorithm using the heap() function before calling run() or init().
#include <lemon/dijkstra.h>
Additional Inherited Members | |
![]() | |
typedef SetStandardHeapTraits < H, CR >::Digraph | Digraph |
The type of the digraph the algorithm runs on. | |
typedef SetStandardHeapTraits < H, CR >::LengthMap::Value | Value |
The type of the length of the arcs. | |
typedef SetStandardHeapTraits < H, CR >::LengthMap | LengthMap |
The type of the map that stores the arc lengths. | |
typedef SetStandardHeapTraits < H, CR >::PredMap | PredMap |
The type of the map that stores the predecessor arcs of the shortest paths. | |
typedef SetStandardHeapTraits < H, CR >::DistMap | DistMap |
The type of the map that stores the distances of the nodes. | |
typedef SetStandardHeapTraits < H, CR >::ProcessedMap | ProcessedMap |
The type of the map that indicates which nodes are processed. | |
typedef PredMapPath< Digraph, PredMap > | Path |
The type of the paths. | |
typedef SetStandardHeapTraits < H, CR >::HeapCrossRef | HeapCrossRef |
The cross reference type used for the current heap. | |
typedef SetStandardHeapTraits < H, CR >::Heap | Heap |
The heap type used by the algorithm. | |
typedef SetStandardHeapTraits < H, CR >::OperationTraits | OperationTraits |
The operation traits class of the algorithm. | |
typedef SetStandardHeapTraits < H, CR > | Traits |
The traits class of the algorithm. | |
![]() | |
Dijkstra (const Digraph &g, const LengthMap &length) | |
Constructor. | |
~Dijkstra () | |
Destructor. | |
Dijkstra & | lengthMap (const LengthMap &m) |
Sets the length map. | |
Dijkstra & | predMap (PredMap &m) |
Sets the map that stores the predecessor arcs. | |
Dijkstra & | processedMap (ProcessedMap &m) |
Sets the map that indicates which nodes are processed. | |
Dijkstra & | distMap (DistMap &m) |
Sets the map that stores the distances of the nodes. | |
Dijkstra & | heap (Heap &hp, HeapCrossRef &cr) |
Sets the heap and the cross reference used by algorithm. | |
const PredMap & | predMap () const |
Returns a const reference to the node map that stores the predecessor arcs. | |
const DistMap & | distMap () const |
Returns a const reference to the node map that stores the distances of the nodes. | |
Path | path (Node t) const |
The shortest path to a node. | |
Value | dist (Node v) const |
The distance of a node from the root(s). | |
Arc | predArc (Node v) const |
Returns the 'previous arc' of the shortest path tree for a node. | |
Node | predNode (Node v) const |
Returns the 'previous node' of the shortest path tree for a node. | |
bool | reached (Node v) const |
Checks if a node is reached from the root(s). | |
bool | processed (Node v) const |
Checks if a node is processed. | |
Value | currentDist (Node v) const |
The current distance of a node from the root(s). | |
void | init () |
void | addSource (Node s, Value dst=OperationTraits::zero()) |
Adds a new source node. | |
Node | processNextNode () |
Processes the next node in the priority heap. | |
Node | nextNode () const |
The next node to be processed. | |
bool | emptyQueue () const |
Returns false if there are nodes to be processed. | |
int | queueSize () const |
Returns the number of the nodes to be processed. | |
void | start () |
Executes the algorithm. | |
void | start (Node t) |
Executes the algorithm until the given target node is processed. | |
Node | start (const NodeBoolMap &nm) |
Executes the algorithm until a condition is met. | |
void | run (Node s) |
Runs the algorithm from the given source node. | |
bool | run (Node s, Node t) |
Finds the shortest path between s and t . | |