Files | |
file | bellman_ford.h |
BellmanFord algorithm. | |
file | bfs.h |
Bfs algorithm. | |
file | dag_shortest_path.h |
DagShortestPath algorithm. | |
file | dfs.h |
Dfs algorithm. | |
file | dijkstra.h |
Dijkstra algorithm. | |
file | floyd_warshall.h |
FloydWarshall algorithm. | |
file | johnson.h |
Johnson algorithm. | |
file | min_cost_flow.h |
An algorithm for finding a flow of value k (for small values of k ) having minimal total cost. | |
file | preflow.h |
Implementation of the preflow algorithm. | |
file | suurballe.h |
An algorithm for finding k paths of minimal total length. | |
Classes | |
class | BellmanFord |
BellmanFord algorithm class. More... | |
class | Bfs |
BFS algorithm class. More... | |
class | DagShortestPath |
DagShortestPath algorithm class. More... | |
class | Dfs |
DFS algorithm class. More... | |
class | DfsVisit |
DFS Visit algorithm class. More... | |
class | Dijkstra |
Dijkstra algorithm class. More... | |
class | FloydWarshall |
FloydWarshall algorithm class. More... | |
class | Johnson |
Johnson algorithm class. More... | |
class | MinCostFlow |
Implementation of an algorithm for finding a flow of value k (for small values of k ) having minimal total cost between 2 nodes. More... | |
class | Preflow |
Preflow algorithms class. More... | |
class | Suurballe |
Implementation of an algorithm for finding k edge-disjoint paths between 2 nodes of minimal total length. More... | |
Functions | |
template<class _Graph, class _LengthMap> | |
BellmanFordWizard< BellmanFordWizardBase< _Graph, _LengthMap > > | lemon::bellmanFord (const _Graph &graph, const _LengthMap &length, typename _Graph::Node source=INVALID) |
Function type interface for BellmanFord algorithm. | |
template<class GR> | |
BfsWizard< BfsWizardBase< GR > > | lemon::bfs (const GR &g, typename GR::Node s=INVALID) |
Function type interface for Bfs algorithm. | |
template<class _Graph, class _LengthMap> | |
DagShortestPathWizard< DagShortestPathWizardBase< _Graph, _LengthMap > > | lemon::dagShortestPath (const _Graph &graph, const _LengthMap &length, typename _Graph::Node source=INVALID) |
Function type interface for DagShortestPath algorithm. | |
template<class GR> | |
DfsWizard< DfsWizardBase< GR > > | lemon::dfs (const GR &g, typename GR::Node s=INVALID) |
Function type interface for Dfs algorithm. | |
template<class GR, class LM> | |
DijkstraWizard< DijkstraWizardBase< GR, LM > > | lemon::dijkstra (const GR &g, const LM &l, typename GR::Node s=INVALID) |
Function type interface for Dijkstra algorithm. | |
template<class GR, class CM, class FM> | |
Preflow< GR, typename CM::Value, CM, FM > | lemon::preflow (const GR &g, typename GR::Node source, typename GR::Node target, const CM &cap, FM &flow) |
Function type interface for Preflow algorithm. |
|
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();
|
|
Function type interface for Bfs algorithm. This function also has several named parameters, they are declared as the members of class BfsWizard. The following example shows how to use these parameters. bfs(g,source).predMap(preds).run();
|
|
Function type interface for DagShortestPath algorithm. This function also has several named parameters, they are declared as the members of class DagShortestPathWizard. The following example shows how to use these parameters. dagShortestPath(g,length,source).predMap(preds).run();
|
|
Function type interface for Dfs algorithm. This function also has several named parameters, they are declared as the members of class DfsWizard. The following example shows how to use these parameters. dfs(g,source).predMap(preds).run();
|
|
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();
|
|
Function type interface for Preflow algorithm.
|