The QuickGraph.Algorithms.MaximumFlow contains
algorithms to compute network maximum flows.
Under construction
Classes
| Class | Description | |
|---|---|---|
 | EdmondsKarpMaximumFlowAlgorithm | Edmonds-Karp Maximum Flow Algorithm |
| MaximumFlowAlgorithm |
Abstract base class for maximum flow algorithms.
|
| PushRelabelMaximumFlowAlgorithm | Push-Relabel Maximum Flow Algorithm |
| ReversedEdgeAugmentorAlgorithm |
A IAlgorithm implementation that augments a
IMutableVertexAndEdgeListGraph such that
for all edge (u,v) there exists the edge (v,u) in the graph.
|
