hkSrSSKrSSKJr SSKJr /SQr\"S5\RS55r \"S5\RS 55r \"S5\RS 55r \"S5\RS 55r S r g) zConnected components.N)not_implemented_for)arbitrary_element)number_connected_componentsconnected_components is_connectednode_connected_componentdirectedc## [5n[U5nUH+nX1;dM [XU5nURU5 Uv M- g7f)axGenerate connected components. Parameters ---------- G : NetworkX graph An undirected graph Returns ------- comp : generator of sets A generator of sets of nodes, one for each component of G. Raises ------ NetworkXNotImplemented If G is directed. Examples -------- Generate a sorted list of connected components, largest first. >>> G = nx.path_graph(4) >>> nx.add_path(G, [10, 11, 12]) >>> [len(c) for c in sorted(nx.connected_components(G), key=len, reverse=True)] [4, 3] If you only want the largest connected component, it's more efficient to use max instead of sort. >>> largest_cc = max(nx.connected_components(G), key=len) To create the induced subgraph of each component use: >>> S = [G.subgraph(c).copy() for c in nx.connected_components(G)] See Also -------- strongly_connected_components weakly_connected_components Notes ----- For undirected graphs only. N)setlen _plain_bfsupdate)Gseennvcs Z/var/www/html/env/lib/python3.13/site-packages/networkx/algorithms/components/connected.pyrrsC` 5D AA  =1#A KKNG s A &A c8[S[U555$)aReturns the number of connected components. Parameters ---------- G : NetworkX graph An undirected graph. Returns ------- n : integer Number of connected components Raises ------ NetworkXNotImplemented If G is directed. Examples -------- >>> G = nx.Graph([(0, 1), (1, 2), (5, 6), (3, 4)]) >>> nx.number_connected_components(G) 3 See Also -------- connected_components number_weakly_connected_components number_strongly_connected_components Notes ----- For undirected graphs only. c3&# UHnSv M g7fN).0ccs r .number_connected_components..ns32Rq2)sumr)rs rrrIsJ 3/23 33c [U5nUS:Xa[R"S5e[S[ X[ U5555[U5:H$)aReturns True if the graph is connected, False otherwise. Parameters ---------- G : NetworkX Graph An undirected graph. Returns ------- connected : bool True if the graph is connected, false otherwise. Raises ------ NetworkXNotImplemented If G is directed. Examples -------- >>> G = nx.path_graph(4) >>> print(nx.is_connected(G)) True See Also -------- is_strongly_connected is_weakly_connected is_semiconnected is_biconnected connected_components Notes ----- For undirected graphs only. rz-Connectivity is undefined for the null graph.c3&# UHnSv M g7frr)rnodes rris_connected..sDCTqCr)r nxNetworkXPointlessConceptr rrrrs rrrqsTN AAAv)) ;   DZ.?.BCD DA NNr!c.[U[U5U5$)a-Returns the set of nodes in the component of graph containing node n. Parameters ---------- G : NetworkX Graph An undirected graph. n : node label A node in G Returns ------- comp : set A set of nodes in the component of G containing node n. Raises ------ NetworkXNotImplemented If G is directed. Examples -------- >>> G = nx.Graph([(0, 1), (1, 2), (5, 6), (3, 4)]) >>> nx.node_connected_component(G, 0) # nodes of component that contains node 0 {0, 1, 2} See Also -------- connected_components Notes ----- For undirected graphs only. )rr r(s rr r sL aQ ##r!cURnU1nU/nU(a]Un/nUHJnX7H,nX;dM URU5 URU5 M. [U5U:XdMHUs $ U(aM]U$)zA fast BFS node generator)_adjaddappendr ) rrsourceadjr nextlevel thislevelrws rrrsz &&C 8DI   AV=HHQK$$Q'4yA~  ) Kr!)__doc__networkxr&networkx.utils.decoratorsrutilsr__all__ _dispatchablerrrr rrr!rr9s9& Z 4!4nZ #4!#4LZ *O!*OZZ $$!$$Nr!