Gd]dZddlZddlmZddlmZgdZejeddZ d Z ejedd Z ejedd Z d Z dS) zConnected components.N)not_implemented_for)arbitrary_element)number_connected_componentsconnected_components is_connectednode_connected_componentdirectedc#Kt}|D]/}||vr)t||}|||V0dS)aGenerate 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)set _plain_bfsupdate)Gseenvcs Hlib/python3.11/site-packages/networkx/algorithms/components/connected.pyrrs\` 55D  D==1a  A KKNNNGGG cNtdt|DS)a Returns the number of connected components. Parameters ---------- G : NetworkX graph An undirected graph. Returns ------- n : integer Number of connected components 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. c3K|]}dVdSN).0ccs r z.number_connected_components..es"33Rq333333r)sumrrs rrrGs*< 33/22333 3 33rc t|dkrtjddtdt |t |Dt|kS)agReturns 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. rzConnectivity is undefined zfor the null graph.c3K|]}dVdSrr)rnodes rrzis_connected..s"AATqAAAAAAr)lennxNetworkXPointlessConceptrr rrs rrrhslN 1vv{{) (*?    AAZ+>> 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. )r )rns rr r sL a  rc|j}t}|h}|rK|}t}|D]6}||vr0|||||7|K|S)zA fast BFS node generator)adjr addr)rsourceG_adjr nextlevel thislevelrs rr r s EE 55DI + EE  + +A}}   q*** + Kr)__doc__networkxr#networkx.utils.decoratorsrutilsr__all__ _dispatchrrrr r rrrr4s999999&&&&&&   Z  33! 3l444BZ  )L)L! )LXZ  $$! $N     r