networkx 2.8.2 Pypi GitHub Homepage
Other Docs
ParametersReturnsBackRef
is_locally_k_edge_connected(G, s, t, k)

Is it impossible to disconnect s and t by removing fewer than k edges? If so, then s and t are locally k-edge-connected in G.

Parameters

G : NetworkX graph

An undirected graph.

s : node

Source node

t : node

Target node

k : integer

local edge connectivity for nodes s and t

Returns

boolean

True if s and t are locally k-edge-connected in G.

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

See Also

is_k_edge_connected

func

Examples

>>> from networkx.algorithms.connectivity import is_locally_k_edge_connected
... G = nx.barbell_graph(10, 0)
... is_locally_k_edge_connected(G, 5, 15, k=1) True
>>> is_locally_k_edge_connected(G, 5, 15, k=2)
False
>>> is_locally_k_edge_connected(G, 1, 5, k=2)
True
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

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#74
type: <class 'function'>
Commit: