bridge_components(G)
Bridge-connected components are also known as 2-edge-connected components.
If the input graph is directed or a multigraph.
Finds all bridge-connected components G.
biconnected_components
similar to this function, but is defined using 2-node-connectivity instead of 2-edge-connectivity.
k_edge_subgraphs
this function is a special case for an undirected graph where k=2.
>>> # The barbell graph with parameter zero has a single bridgeSee :
... G = nx.barbell_graph(5, 0)
... from networkx.algorithms.connectivity.edge_kcomponents import bridge_components
... sorted(map(sorted, bridge_components(G))) [[0, 1, 2, 3, 4], [5, 6, 7, 8, 9]]
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.components.biconnected.biconnected_components
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