|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use AbstractWeightedGraph.FlowGraph | |
---|---|
goldman.graph | A graph represents general relationships between pairs of elements from among a set of elements. |
Uses of AbstractWeightedGraph.FlowGraph in goldman.graph |
---|
Methods in goldman.graph that return AbstractWeightedGraph.FlowGraph | |
---|---|
AbstractWeightedGraph.FlowGraph |
WeightedGraph.maximumFlow(V source,
V sink)
Uses the Edmonds-Karp implementation of the basic Ford-Fulkerson augmenting path method to find a maximum flow (and a minimum cut) for the flow network defined by the provided source and sink. |
AbstractWeightedGraph.FlowGraph |
AbstractWeightedGraph.maximumFlow(V s,
V t)
|
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |