All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
Classes | Files | Functions
Shortest Path Algorithms
Algorithms

Detailed Description

This group contains the algorithms for finding shortest paths in digraphs.

Classes

class  Dijkstra< GR, LEN, TR >
 Dijkstra algorithm class. More...
 
class  Suurballe< GR, LEN >
 Algorithm for finding arc-disjoint paths between two nodes having minimum total length. More...
 
struct  Dijkstra< GR, LEN, TR >::SetDistMap< T >
 Named parameter for setting DistMap type. More...
 
struct  Dijkstra< GR, LEN, TR >::SetHeap< H, CR >
 Named parameter for setting heap and cross reference types More...
 
struct  Dijkstra< GR, LEN, TR >::SetOperationTraits< T >
 Named parameter for setting OperationTraits type More...
 
struct  Dijkstra< GR, LEN, TR >::SetPredMap< T >
 Named parameter for setting PredMap type. More...
 
struct  Dijkstra< GR, LEN, TR >::SetProcessedMap< T >
 Named parameter for setting ProcessedMap type. More...
 
struct  Dijkstra< GR, LEN, TR >::SetStandardHeap< H, CR >
 Named parameter for setting heap and cross reference types with automatic allocation More...
 
struct  Dijkstra< GR, LEN, TR >::SetStandardProcessedMap
 Named parameter for setting ProcessedMap type to be Digraph::NodeMap<bool>. More...
 

Files

file  dijkstra.h
 Dijkstra algorithm.
 
file  suurballe.h
 An algorithm for finding arc-disjoint paths between two nodes having minimum total length.
 

Functions

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

Function Documentation

DijkstraWizard<DijkstraWizardBase<GR,LEN> > lemon::dijkstra ( const GR &  digraph,
const LEN &  length 
)

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