networks(deprecated)/countcuts - Help

networks

 countcuts
 counts minimum network cuts of an undirected graph

 Calling Sequence countcuts(G)

Parameters

 G - graph or network

Description

 • Important: The networks package has been deprecated.  Use the superseding package GraphTheory instead.
 • This procedure computes the number of network cutsets of minimum cardinality in an undirected multigraph.
 • It is normally loaded via the command with(networks) but may also be referenced using the full name networks[countcuts](...).

Examples

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

 > $\mathrm{with}\left(\mathrm{networks}\right):$
 > $G≔\mathrm{petersen}\left(\right):$
 > $\mathrm{countcuts}\left(G\right)$
 ${2}$ (1)
 > $\mathrm{K34}≔\mathrm{complete}\left(3,4\right):$
 > $\mathrm{countcuts}\left(\mathrm{K34}\right)$
 ${4}$ (2)
 > $\mathrm{Cyc8}≔\mathrm{new}\left(\right):$
 > $\mathrm{addvertex}\left(\left\{\mathrm{BC},\mathrm{AB},\mathrm{SK},\mathrm{MB},\mathrm{ON},\mathrm{NB},\mathrm{NS},\mathrm{NF}\right\},\mathrm{Cyc8}\right)$
 ${\mathrm{AB}}{,}{\mathrm{BC}}{,}{\mathrm{MB}}{,}{\mathrm{NB}}{,}{\mathrm{NF}}{,}{\mathrm{NS}}{,}{\mathrm{ON}}{,}{\mathrm{SK}}$ (3)
 > $\mathrm{addedge}\left(\mathrm{Cycle}\left(\right),\mathrm{Cyc8}\right):$
 > $\mathrm{countcuts}\left(\mathrm{Cyc8}\right)$
 ${28}$ (4)