Classes | |
class | Dijkstra |
Dijkstra algorithm class. More... | |
Files | |
file | dijkstra.h |
Dijkstra algorithm. | |
Functions | |
template<class GR , class LM > | |
DijkstraWizard < DijkstraWizardBase< GR, LM > > | dijkstra (const GR &digraph, const LM &length) |
Function-type interface for Dijkstra algorithm. |
DijkstraWizard<DijkstraWizardBase<GR,LM> > lemon::dijkstra | ( | const GR & | digraph, | |
const LM & | length | |||
) | [inline] |
Function-type interface for Dijkstra algorithm.
This function also has several named parameters, they are declared as the members of class DijkstraWizard. The following examples show how to use these parameters.
// Compute shortest path from node s to each node dijkstra(g,length).predMap(preds).distMap(dists).run(s); // Compute shortest path from s to t bool reached = dijkstra(g,length).path(p).dist(d).run(s,t);