![]() |
Satsuma
a delicious .NET graph library
|
Finds a maximum flow using the Goldberg-Tarjan preflow algorithm. More...
Public Member Functions | |
| double | Flow (Arc arc) |
| The amount flowing through an arc. More... | |
| Preflow (IGraph graph, Func< Arc, double > capacity, Node source, Node target) | |
Properties | |
| Func< Arc, double > | Capacity [get, set] |
| double | Error [get, set] |
| A (usually very small) approximate upper bound for the difference between FlowSize and the actual maximum flow value. More... | |
| double | FlowSize [get, set] |
| IGraph | Graph [get, set] |
| IEnumerable< KeyValuePair< Arc, double > > | NonzeroArcs [get] |
| Node | Source [get, set] |
| Node | Target [get, set] |
Finds a maximum flow using the Goldberg-Tarjan preflow algorithm.
Let D denote the sum of capacities for all arcs exiting Source.
Definition at line 61 of file Preflow.cs.
Definition at line 76 of file Preflow.cs.
| double Satsuma.Preflow.Flow | ( | Arc | arc | ) |
The amount flowing through an arc.
Capacity(arc) if the arc is NOT an edge, or between -Capacity(arc) and Capacity(arc) if the arc is an edge. Implements Satsuma.IFlow< TCapacity >.
Definition at line 157 of file Preflow.cs.
|
getset |
Definition at line 64 of file Preflow.cs.
|
getset |
A (usually very small) approximate upper bound for the difference between FlowSize and the actual maximum flow value.
Definition at line 74 of file Preflow.cs.
|
getset |
Definition at line 68 of file Preflow.cs.
|
getset |
Definition at line 63 of file Preflow.cs.
|
get |
Definition at line 150 of file Preflow.cs.
|
getset |
Definition at line 65 of file Preflow.cs.
|
getset |
Definition at line 66 of file Preflow.cs.
1.8.3.1