Shortest Path Algorithms
[Algorithms]


Detailed Description

This group describes the algorithms for finding shortest paths in graphs.


Files

file  dijkstra.h
 Dijkstra algorithm.

Classes

class  Dijkstra
 Dijkstra algorithm class. More...

Functions

template<class GR, class LM>
DijkstraWizard
< DijkstraWizardBase< GR, LM > > 
dijkstra (const GR &digraph, const LM &length)
 Function-type interface for Dijkstra algorithm.


Function Documentation

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);
Warning:
Don't forget to put the run() to the end of the parameter list.
See also:
DijkstraWizard

Dijkstra


Generated on Tue May 5 07:41:37 2009 for LEMON by  doxygen 1.5.6