#include <lemon/dijkstra.h>
Simplicity means that the way to change the types defined in the traits class is based on functions that returns the new class and not on templatable built-in classes. When using the plain Dijkstra the new class with the modified type comes from the original class by using the :: operator. In the case of DijkstraWizard only a function have to be called and it will return the needed class.
It does not have own run method. When its run method is called it initiates a plain Dijkstra class, and calls the Dijkstra::run method of it.
Public Member Functions | |
DijkstraWizard () | |
Constructor. | |
DijkstraWizard (const Graph &g, const LengthMap &l, Node s=INVALID) | |
Constructor that requires parameters. | |
DijkstraWizard (const TR &b) | |
Copy constructor. | |
void | run () |
Runs Dijkstra algorithm from a given node. | |
void | run (Node s) |
Runs Dijkstra algorithm from the given node. | |
template<class T> | |
DijkstraWizard< DefPredMapBase< T > > | predMap (const T &t) |
Named parameter function for setting PredMap type | |
template<class T> | |
DijkstraWizard< DefDistMapBase< T > > | distMap (const T &t) |
Named parameter function for setting DistMap type | |
DijkstraWizard< TR > & | source (Node s) |
Sets the source node, from which the Dijkstra algorithm runs. |
|
Constructor that requires parameters. These parameters will be the default values for the traits class. |
|
Runs Dijkstra algorithm from a given node. The node can be given by the source function. |
|
Runs Dijkstra algorithm from the given node.
|
|
Named parameter function for setting PredMap type |
|
Named parameter function for setting DistMap type |
|
Sets the source node, from which the Dijkstra algorithm runs.
|