h18SrSSKJr SSKrSSKJr /SQr\"S5\RS55r \"S5\RS55r \"S5\RS 55r \"S5\RS 55r \"S5S S j5r g) z/Biconnected components and articulation points.)chainN)not_implemented_for)biconnected_componentsbiconnected_component_edgesis_biconnectedarticulation_pointsdirectedc[U5n[U5n[U5 g![a gf=f![a [U5[U5:Hs$f=f)uReturns True if the graph is biconnected, False otherwise. A graph is biconnected if, and only if, it cannot be disconnected by removing only one node (and all edges incident on that node). If removing a node increases the number of disconnected components in the graph, that node is called an articulation point, or cut vertex. A biconnected graph has no articulation points. Parameters ---------- G : NetworkX Graph An undirected graph. Returns ------- biconnected : bool True if the graph is biconnected, False otherwise. Raises ------ NetworkXNotImplemented If the input graph is not undirected. Examples -------- >>> G = nx.path_graph(4) >>> print(nx.is_biconnected(G)) False >>> G.add_edge(0, 3) >>> print(nx.is_biconnected(G)) True See Also -------- biconnected_components articulation_points biconnected_component_edges is_strongly_connected is_weakly_connected is_connected is_semiconnected Notes ----- The algorithm to find articulation points and biconnected components is implemented using a non-recursive depth-first-search (DFS) that keeps track of the highest level that back edges reach in the DFS tree. A node `n` is an articulation point if, and only if, there exists a subtree rooted at `n` such that there is no back edge from any successor of `n` that links to a predecessor of `n` in the DFS tree. By keeping track of all the edges traversed by the DFS we can obtain the biconnected components because all edges of a bicomponent will be traversed consecutively between articulation points. References ---------- .. [1] Hopcroft, J.; Tarjan, R. (1973). "Efficient algorithms for graph manipulation". Communications of the ACM 16: 372–378. doi:10.1145/362248.362272 F)rnext StopIterationlen)Gbccsbccs \/var/www/html/env/lib/python3.13/site-packages/networkx/algorithms/components/biconnected.pyrrseB "! $D4j T   "3x3q6!!"s % 5 22!AAc#4# [USS9ShvN gN7f)uReturns a generator of lists of edges, one list for each biconnected component of the input graph. Biconnected components are maximal subgraphs such that the removal of a node (and all edges incident on that node) will not disconnect the subgraph. Note that nodes may be part of more than one biconnected component. Those nodes are articulation points, or cut vertices. However, each edge belongs to one, and only one, biconnected component. Notice that by convention a dyad is considered a biconnected component. Parameters ---------- G : NetworkX Graph An undirected graph. Returns ------- edges : generator of lists Generator of lists of edges, one list for each bicomponent. Raises ------ NetworkXNotImplemented If the input graph is not undirected. Examples -------- >>> G = nx.barbell_graph(4, 2) >>> print(nx.is_biconnected(G)) False >>> bicomponents_edges = list(nx.biconnected_component_edges(G)) >>> len(bicomponents_edges) 5 >>> G.add_edge(2, 8) >>> print(nx.is_biconnected(G)) True >>> bicomponents_edges = list(nx.biconnected_component_edges(G)) >>> len(bicomponents_edges) 1 See Also -------- is_biconnected, biconnected_components, articulation_points, Notes ----- The algorithm to find articulation points and biconnected components is implemented using a non-recursive depth-first-search (DFS) that keeps track of the highest level that back edges reach in the DFS tree. A node `n` is an articulation point if, and only if, there exists a subtree rooted at `n` such that there is no back edge from any successor of `n` that links to a predecessor of `n` in the DFS tree. By keeping track of all the edges traversed by the DFS we can obtain the biconnected components because all edges of a bicomponent will be traversed consecutively between articulation points. References ---------- .. [1] Hopcroft, J.; Tarjan, R. (1973). "Efficient algorithms for graph manipulation". Communications of the ACM 16: 372–378. doi:10.1145/362248.362272 T componentsN)_biconnected_dfs)rs rrrasL d333s c#p# [USS9H$n[[R"U55v M& g7f)u; Returns a generator of sets of nodes, one set for each biconnected component of the graph Biconnected components are maximal subgraphs such that the removal of a node (and all edges incident on that node) will not disconnect the subgraph. Note that nodes may be part of more than one biconnected component. Those nodes are articulation points, or cut vertices. The removal of articulation points will increase the number of connected components of the graph. Notice that by convention a dyad is considered a biconnected component. Parameters ---------- G : NetworkX Graph An undirected graph. Returns ------- nodes : generator Generator of sets of nodes, one set for each biconnected component. Raises ------ NetworkXNotImplemented If the input graph is not undirected. Examples -------- >>> G = nx.lollipop_graph(5, 1) >>> print(nx.is_biconnected(G)) False >>> bicomponents = list(nx.biconnected_components(G)) >>> len(bicomponents) 2 >>> G.add_edge(0, 5) >>> print(nx.is_biconnected(G)) True >>> bicomponents = list(nx.biconnected_components(G)) >>> len(bicomponents) 1 You can generate a sorted list of biconnected components, largest first, using sort. >>> G.remove_edge(0, 5) >>> [len(c) for c in sorted(nx.biconnected_components(G), key=len, reverse=True)] [5, 2] If you only want the largest connected component, it's more efficient to use max instead of sort. >>> Gc = max(nx.biconnected_components(G), key=len) To create the components as subgraphs use: ``(G.subgraph(c).copy() for c in biconnected_components(G))`` See Also -------- is_biconnected articulation_points biconnected_component_edges k_components : this function is a special case where k=2 bridge_components : similar to this function, but is defined using 2-edge-connectivity instead of 2-node-connectivity. Notes ----- The algorithm to find articulation points and biconnected components is implemented using a non-recursive depth-first-search (DFS) that keeps track of the highest level that back edges reach in the DFS tree. A node `n` is an articulation point if, and only if, there exists a subtree rooted at `n` such that there is no back edge from any successor of `n` that links to a predecessor of `n` in the DFS tree. By keeping track of all the edges traversed by the DFS we can obtain the biconnected components because all edges of a bicomponent will be traversed consecutively between articulation points. References ---------- .. [1] Hopcroft, J.; Tarjan, R. (1973). "Efficient algorithms for graph manipulation". Communications of the ACM 16: 372–378. doi:10.1145/362248.362272 TrN)rsetr from_iterable)rcomps rrrs/r!t4%%%d+,,5s46c#z# [5n[USS9HnX!;dM URU5 Uv M! g7f)uYield the articulation points, or cut vertices, of a graph. An articulation point or cut vertex is any node whose removal (along with all its incident edges) increases the number of connected components of a graph. An undirected connected graph without articulation points is biconnected. Articulation points belong to more than one biconnected component of a graph. Notice that by convention a dyad is considered a biconnected component. Parameters ---------- G : NetworkX Graph An undirected graph. Yields ------ node An articulation point in the graph. Raises ------ NetworkXNotImplemented If the input graph is not undirected. Examples -------- >>> G = nx.barbell_graph(4, 2) >>> print(nx.is_biconnected(G)) False >>> len(list(nx.articulation_points(G))) 4 >>> G.add_edge(2, 8) >>> print(nx.is_biconnected(G)) True >>> len(list(nx.articulation_points(G))) 0 See Also -------- is_biconnected biconnected_components biconnected_component_edges Notes ----- The algorithm to find articulation points and biconnected components is implemented using a non-recursive depth-first-search (DFS) that keeps track of the highest level that back edges reach in the DFS tree. A node `n` is an articulation point if, and only if, there exists a subtree rooted at `n` such that there is no back edge from any successor of `n` that links to a predecessor of `n` in the DFS tree. By keeping track of all the edges traversed by the DFS we can obtain the biconnected components because all edges of a bicomponent will be traversed consecutively between articulation points. References ---------- .. [1] Hopcroft, J.; Tarjan, R. (1973). "Efficient algorithms for graph manipulation". Communications of the ACM 16: 372–378. doi:10.1145/362248.362272 FrN)rradd)rseen articulations rrrs8H 5D(u=  # HH\ " >s;;c ## [5nUGH.nX2;aM US0nUS0nSnURU5 /nX3[X54/n0n U(aUSupn [U 5n X:XaM"X;aEXMXK::a:[ X[XM5X['U(a![ U5XU 4'UR X45 Oh[ U5=X]'XM'URU 5 UR X[X 545 U(a![ U5XU 4'UR X45 U(aMU(aGM!US:dGM*Uv GM1 g![a UR5 [ U5S:a:X[XJ:aU(aXU 4nX~Sv X~S2 OU v [ X[XZ5XZ'NU(aUS- nU(aXU 4nX~Sv X~S2 Nf=f7f)Nr) rriterr minr appendr pop)rrvisitedstart discoverylow root_children edge_stackstack edge_index grandparentparentchildrenchildinds rrrRseG   AJ aj  E QX/0 ,1"I )K# -X'# '9+<<&)#+y7G&H %8;JJu}5&--vo>47 NBCJ!1KK&LL&ah!@A!47 O 5=1"))6/:%eLzq  g<! - u:>{i&<<%",&-@"AC",T"22 *4 0#.-'*3;8H'IC$!Q&M!(f)<=(..&t,# -scAGE)G+A E4G5A(EG&G0G9 GA!G $G&#G  G G  G)T)__doc__ itertoolsrnetworkxnxnetworkx.utils.decoratorsr__all__ _dispatchablerrrrrrr;s59 Z L!L^Z D4!D4NZ X-!X-vZ F!FRZ 7!7r: