 |
SOLUTIONS
|
|
|
|
||
|
|
| COMBINATORICA PACKAGE SYMBOL | Tutorials »|See Also »|More About » |
 returns the value of a maximum flow through graph  from source to sink. |
| NetworkFlow[g, source, sink, Edge] returns the edges in  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  along with flows on each edge in a maximum flow from source to sink. |
, you first need to load the Combinatorica Package using 
.
can be a directed or an undirected graph.
|
Choose Language
  |
