![]() |
abLEMON 1.9.0-101-gccb8629
A maintained fork of LEMON
|
Algorithms for finding shortest paths. More...
Files | |
| file | astar.h |
| file | bellman_ford.h |
| Bellman-Ford algorithm. | |
| file | bidir_dijkstra.h |
| file | dijkstra.h |
| file | suurballe.h |
Classes | |
| class | AStar< GR , LEN , HM , TR > |
| A* algorithm for a shortest path between two nodes. More... | |
| class | BellmanFord< GR , LEN , TR > |
| BellmanFord algorithm class. More... | |
| class | BidirDijkstra< GR , LEN , TR > |
| Bidirectional Dijkstra algorithm for a shortest path between two nodes. 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... | |
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. | |
This group contains the algorithms for finding shortest paths in digraphs [7].
| 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.