NetworkFlow

As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. >>

NetworkFlow[g,source,sink]
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.

DetailsDetails

ExamplesExamplesopen allclose all

Basic Examples  (2)Basic Examples  (2)

In[1]:=
Click for copyable input
In[2]:=
Click for copyable input
In[3]:=
Click for copyable input
Out[3]=
In[4]:=
Click for copyable input
Out[4]=

NetworkFlow has been superseded by FindMaximumFlow:

In[1]:=
Click for copyable input
Out[1]=
In[2]:=
Click for copyable input
Out[2]=
Translate this page: