|
networks[countcuts] - counts minimum network cuts of an undirected graph
|
|
Calling Sequence
|
|
countcuts(G)
|
|
|
Description
|
|
|
•
|
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.
|
>
|
|
|
>
|
|
|
>
|
|
|
| (1) |
|
>
|
|
|
>
|
|
|
| (2) |
|
>
|
|
|
>
|
|
|
| (3) |
|
>
|
|
|
>
|
|
|
| (4) |
|
|
Download Help Document
Was this information helpful?
