 |
NetworkFlow
returns the value of a maximum flow through graph g from source to sink.
NetworkFlow[g, source, sink, Edge]
returns the edges in g that have positive flow, along with their flows, in a maximum flow from source to sink.
NetworkFlow[g, source, sink, Cut]
returns a minimum cut between source and sink.
NetworkFlow[g, source, sink, All]
returns the adjacency list of g along with flows on each edge in a maximum flow from source to sink.
更多信息
- To use
, you first need to load the Combinatorica Package using Needs["Combinatorica`"]. - The graph g can be a directed or an undirected graph.
