My Project
|
This group contains the algorithms for finding shortest paths in digraphs [clrs01algorithms].
Classes | |
class | BellmanFord< GR, LEN, TR > |
BellmanFord algorithm class. More... | |
class | Dijkstra< GR, LEN, TR > |
Dijkstra algorithm class. More... | |
class | Suurballe< GR, LEN, TR > |
Algorithm for finding arc-disjoint paths between two nodes having minimum total length. More... | |
Files | |
file | bellman_ford.h |
Bellman-Ford algorithm. | |
file | dijkstra.h |
file | suurballe.h |
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 > > 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 > > 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.