counts minimum network cuts of an undirected graph
graph or network
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](...).
G ≔ petersen⁡:
K34 ≔ complete⁡3,4:
Cyc8 ≔ new⁡:
Download Help Document
What kind of issue would you like to report? (Optional)
Thank you for submitting feedback on this help document. Your feedback will be used
to improve Maple's help in the future.