Maximum flow algorithm (Edmonds-Karp). More...
#include <GTL/maxflow_ff.h>
Inherits: algorithm
[public]
Default constructor. Enables only the calculation of maximum flow.
[public virtual]
Destructor.
[public]
Sets capacity of every edge for maximum flow calculation where artificial start-node and end_node will be computed automatically.
edge_capacity | capacity of every edge. |
[public]
Sets capacity of every edge for maximum flow calculation
net_source | start-node. |
edge_capacity | capacity of every edge. |
net_target | end-node. |
[public virtual]
Checks whether following preconditions are satisfied:
G
is directed.
G
is connected.
G
has at least one edge and two nodes.
G | graph |
algorithm::GTL_OK
on success
algorithm::GTL_ERROR
otherwise.[public]
Computes maximum flow of graph G
.
G | graph |
algorithm::GTL_OK
on success
algorithm::GTL_ERROR
otherwise.[public]
Returns the maximum flow of an edge.
e | edge of a graph G |
[public]
Returns the maximum flow of the whole graph G.
[public]
Returns the remaining free capacity of an edge.
e | edge of a graph G |
[public virtual]
Resets maximum flow algorithm, i.e. prepares the algorithm to be applied to another graph.
Kdoc |