|
Files |
file | bfs.h |
| Bfs algorithm.
|
file | dfs.h |
| Dfs algorithm.
|
file | dijkstra.h |
| Dijkstra 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 |
file | suurballe.h |
| An algorithm for finding k paths of minimal total length.
|
Classes |
class | Bfs |
| BFS algorithm class. More...
|
class | Dfs |
| DFS algorithm class. More...
|
class | Dijkstra |
| Dijkstra 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...
|
Enumerations |
enum | lemon::Preflow::FlowEnum |
| Indicates the property of the starting flow map. More...
|
enum | lemon::Preflow::StatusEnum |
| Indicates the state of the preflow algorithm. More...
|
Functions |
template<class GR> |
BfsWizard< BfsWizardBase<
GR > > | lemon::bfs (const GR &g, typename GR::Node s=INVALID) |
| Function type interface for Bfs 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.
|
| lemon::Preflow::Preflow (const Graph &_gr, Node _s, Node _t, const CapacityMap &_cap, FlowMap &_f) |
| The constructor of the class.
|
void | lemon::Preflow::run () |
| Runs the preflow algorithm.
|
void | lemon::Preflow::run (FlowEnum fp) |
| Runs the preflow algorithm.
|
void | lemon::Preflow::phase1 (FlowEnum fp) |
| Runs the first phase of the preflow algorithm.
|
void | lemon::Preflow::phase1 () |
| Runs the first phase of the preflow algorithm.
|
void | lemon::Preflow::phase2 () |
| Runs the second phase of the preflow algorithm.
|
Num | lemon::Preflow::flowValue () const |
| Returns the value of the maximum flow.
|
template<typename _CutMap> |
void | lemon::Preflow::minCut (_CutMap &M) const |
| Returns a minimum value cut.
|
template<typename _CutMap> |
void | lemon::Preflow::minMinCut (_CutMap &M) const |
| Returns the inclusionwise minimum of the minimum value cuts.
|
template<typename _CutMap> |
void | lemon::Preflow::maxMinCut (_CutMap &M) const |
| Returns the inclusionwise maximum of the minimum value cuts.
|
void | lemon::Preflow::source (Node _s) |
| Sets the source node to _s .
|
Node | lemon::Preflow::source () const |
| Returns the source node.
|
void | lemon::Preflow::target (Node _t) |
| Sets the target node to _t .
|
Node | lemon::Preflow::target () const |
| Returns the target node.
|
void | lemon::Preflow::capacityMap (const CapacityMap &_cap) |
| Sets the edge map of the capacities to _cap.
|
const CapacityMap & | lemon::Preflow::capacityMap () const |
| Returns a reference to capacity map.
|
void | lemon::Preflow::flowMap (FlowMap &_f) |
| Sets the edge map of the flows to _flow.
|
const FlowMap & | lemon::Preflow::flowMap () const |
| Returns a reference to flow map.
|
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.
|