returns the value of a maximum flow through graph g from source to sink.
returns the edges in g that have positive flow, along with their flows, in a maximum flow from source to sink.
returns a minimum cut between source and sink.
returns the adjacency list of g along with flows on each edge in a maximum flow from source to sink.
Details and Options
- NetworkFlow functionality is now available in the built-in Wolfram Language function FindMaximumFlow.
- To use NetworkFlow, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
- The graph g can be a directed or an undirected graph.
Basic Examples (2)
NetworkFlow has been superseded by FindMaximumFlow:
Wolfram Research (2012), NetworkFlow, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/NetworkFlow.html.
Wolfram Language. 2012. "NetworkFlow." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/NetworkFlow.html.
Wolfram Language. (2012). NetworkFlow. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/NetworkFlow.html