This group contains the algorithms for finding shortest paths in digraphs [6].
Files | |
file | bellman_ford.h |
Bellman-Ford algorithm. | |
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 > | |
BellmanFordWizard < BellmanFordWizardBase< GR, LEN > > | bellmanFord (const GR &digraph, const LEN &length) |
Function type interface for the Bellman-Ford algorithm. | |
template<typename GR , typename LEN > | |
DijkstraWizard < DijkstraWizardBase< GR, LEN > > | dijkstra (const GR &digraph, const LEN &length) |
Function-type interface for Dijkstra algorithm. | |
BellmanFordWizard<BellmanFordWizardBase<GR,LEN> > lemon::bellmanFord | ( | const GR & | digraph, |
const LEN & | length | ||
) |
Function type interface for the Bellman-Ford algorithm.
This function also has several named parameters, they are declared as the members of class BellmanFordWizard. The following examples show how to use these parameters.
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.