is_k_edge_connected(G, k)

Is it impossible to disconnect the graph by removing fewer than k edges? If so, then G is k-edge-connected.

Parameters

G : NetworkX graph

An undirected graph.

k : integer

edge connectivity to test for

Returns

boolean

True if G is k-edge-connected.

Tests to see if a graph is k-edge-connected.

See Also

is_locally_k_edge_connected

func

Examples

>>> G = nx.barbell_graph(10, 0)
... nx.is_k_edge_connected(G, k=1)
True

>>> nx.is_k_edge_connected(G, k=2)
False

See :

Back References

The following pages refer to to this document either explicitly or contain code examples using this.

networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected

Local connectivity graph

Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.

Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)

SVG is more flexible but power hungry; and does not scale well to 50 + nodes.

All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them

---

GitHub : /networkx/algorithms/connectivity/edge_augmentation.py#24
type: <class 'function'>
Commit: