Shortest Path algorithms
[Algorithms]

---

Detailed Description

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

Classes
class	BellmanFord< _Graph, _LengthMap, _Traits >
	BellmanFord algorithm class. More...
class	Dijkstra< GR, LM, TR >
	Dijkstra algorithm class. More...
class	FloydWarshall< _Graph, _LengthMap, _Traits >
	FloydWarshall algorithm class. More...
class	Johnson< _Graph, _LengthMap, _Traits >
	Johnson algorithm class. More...
class	MinMeanCycle< Graph, LengthMap >
	Implementation of Howard's algorithm for finding a minimum mean directed cycle. More...
class	Suurballe< Graph, LengthMap >
	Implementation of an algorithm for finding edge-disjoint paths between two nodes having minimum total length. More...
Files
file	bellman_ford.h
	BellmanFord algorithm.
file	dijkstra.h
	Dijkstra algorithm.
file	floyd_warshall.h
	FloydWarshall algorithm.
file	johnson.h
	Johnson algorithm.
file	min_mean_cycle.h
	Howard's algorithm for finding a minimum mean directed cycle.
file	suurballe.h
	An algorithm for finding edge-disjoint paths between two nodes having minimum total length.
Functions
template<class _Graph , class _LengthMap >
BellmanFordWizard < BellmanFordWizardBase < _Graph, _LengthMap > >	bellmanFord (const _Graph &graph, const _LengthMap &length, typename _Graph::Node source=INVALID)
	Function type interface for BellmanFord algorithm.
template<class GR , class LM >
DijkstraWizard < DijkstraWizardBase< GR, LM > >	dijkstra (const GR &g, const LM &l, typename GR::Node s=INVALID)
	Function type interface for Dijkstra algorithm.

---

Function Documentation

BellmanFordWizard<BellmanFordWizardBase<_Graph,_LengthMap> > lemon::bellmanFord	(	const _Graph &	graph,
		const _LengthMap &	length,
		typename _Graph::Node	source = INVALID
	)			[inline]

Function type interface for BellmanFord algorithm.

This function also has several named parameters, they are declared as the members of class BellmanFordWizard. The following example shows how to use these parameters.

      bellmanford(g,length,source).predMap(preds).run();

Warning:

Don't forget to put the run() to the end of the parameter list.

See also:

BellmanFordWizard

BellmanFord

DijkstraWizard<DijkstraWizardBase<GR,LM> > lemon::dijkstra	(	const GR &	g,
		const LM &	l,
		typename GR::Node	s = INVALID
	)			[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 example shows how to use these parameters.

       dijkstra(g,length,source).predMap(preds).run();

Warning:

Don't forget to put the run() to the end of the parameter list.

See also:

DijkstraWizard

Dijkstra