This documents the development version of NetworkX. Documentation for the current release can be found here.
Tests to see if a graph is k-edge-connected.
Is it impossible to disconnect the graph by removing fewer than k edges? If so, then G is k-edge-connected.
- GNetworkX graph
An undirected graph.
edge connectivity to test for
True if G is k-edge-connected.
>>> G = nx.barbell_graph(10, 0) >>> nx.is_k_edge_connected(G, k=1) True >>> nx.is_k_edge_connected(G, k=2) False