Satsuma
a delicious .NET graph library
|
Finds a maximum flow for integer capacities using the Goldberg-Tarjan preflow algorithm. More...
Public Member Functions | |
long | Flow (Arc arc) |
The amount flowing through an arc. More... | |
IntegerPreflow (IGraph graph, Func< Arc, long > capacity, Node source, Node target) | |
Properties | |
Func< Arc, long > | Capacity [get, set] |
long | FlowSize [get, set] |
IGraph | Graph [get, set] |
IEnumerable< KeyValuePair< Arc, long > > | NonzeroArcs [get] |
Node | Source [get, set] |
Node | Target [get, set] |
Finds a maximum flow for integer capacities using the Goldberg-Tarjan preflow algorithm.
The sum of capacities on the outgoing edges of Source must be at most long.MaxValue
.
Definition at line 168 of file Preflow.cs.
Satsuma.IntegerPreflow.IntegerPreflow | ( | IGraph | graph, |
Func< Arc, long > | capacity, | ||
Node | source, | ||
Node | target | ||
) |
Definition at line 182 of file Preflow.cs.
long Satsuma.IntegerPreflow.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 307 of file Preflow.cs.
|
getset |
Definition at line 171 of file Preflow.cs.
|
getset |
Definition at line 175 of file Preflow.cs.
|
getset |
Definition at line 170 of file Preflow.cs.
|
get |
Definition at line 300 of file Preflow.cs.
|
getset |
Definition at line 172 of file Preflow.cs.
|
getset |
Definition at line 173 of file Preflow.cs.