finds the minimum cut in a network flow problem
mincut(G, s, t)
mincut(G, s, t, vf)
graph or network
name used to return the value of the flow
Important:The networks package has been deprecated. Use the superseding package GraphTheoryinstead.
This routine returns the smallest set of edges whose deletion disconnects all s, t directed paths.
If vf is passed then on return it will contain the value of the cut.
The routine is normally loaded via the command with(networks) but may also be referenced using the full name networks[mincut](...).
G ≔ petersen⁡:
Download Help Document
What kind of issue would you like to report? (Optional)