networks(deprecated)/mincut - Maple Help

networks

 mincut
 finds the minimum cut in a network flow problem

 Calling Sequence mincut(G, s, t) mincut(G, s, t, vf)

Parameters

 G - graph or network s - source node t - sink node vf - name used to return the value of the flow

Description

 • 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](...).

Examples

Important:The networks package has been deprecated. Use the superseding package GraphTheoryinstead.

 > $\mathrm{with}\left(\mathrm{networks}\right):$
 > $G≔\mathrm{petersen}\left(\right):$
 > $\mathrm{mincut}\left(G,1,2,\mathrm{vf}\right)$
 $\left\{{\mathrm{e1}}{,}{\mathrm{e11}}{,}{\mathrm{e5}}\right\}$ (1)
 > $\mathrm{vf}$
 ${3}$ (2)