finds the edge connectivity of a graph
connectivity(G, lb, s1, s2)
graph or network
known lower bound for the connectivity
name to capture a minimum cut
name to capture a set of super saturated edges
Important: The networks package has been deprecated. Use the superseding command GraphTheory[EdgeConnectivity] instead.
This routine computes the edge connectivity of the graph G. The computation makes use of internal data structures of the graph representation to maintain bounds on connectivity and to keep track of information such as super saturated edges and information about minimum edge cuts.
If a name is provided as a third argument then it is assigned a set of vertices known to contain a minimum edge cut.
If a name is provided as a fourth argument then it is assigned a set of vertices known to be supersaturated.
This routine is normally loaded via the command with(networks) but may be referenced using the full name networks[connectivity](...).
G ≔ complete⁡2,2:
Download Help Document
What kind of issue would you like to report? (Optional)