ó |£*^c@sıdZddlZddlmZdjddgƒZddd d d gZed ƒd „ƒZed ƒe d„ƒZ d„Z ed ƒd„ƒZ ed ƒd„ƒZ d„ZdS(s Connected components. i˙˙˙˙N(tnot_implemented_fors s Eben Kenahs8Aric Hagberg Christopher Ellisontnumber_connected_componentstconnected_componentstconnected_component_subgraphst is_connectedtnode_connected_componenttdirectedccsTtƒ}xD|D]<}||krtt||ƒƒ}|V|j|ƒqqWdS(sGenerate 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. Examples -------- Generate a sorted list of connected components, largest first. >>> G = nx.path_graph(4) >>> G.add_path([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) See Also -------- strongly_connected_components Notes ----- For undirected graphs only. N(tsett _plain_bfstupdate(tGtseentvtc((s|/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/components/connected.pyRs %   ccsFx?t|ƒD]1}|r0|j|ƒjƒVq |j|ƒVq WdS(s,Generate connected components as subgraphs. Parameters ---------- G : NetworkX graph An undirected graph. copy: bool (default=True) If True make a copy of the graph attributes Returns ------- comp : generator A generator of graphs, one for each connected component of G. Examples -------- >>> G = nx.path_graph(4) >>> G.add_edge(5,6) >>> graphs = list(nx.connected_component_subgraphs(G)) If you only want the largest connected component, it's more efficient to use max than sort. >>> Gc = max(nx.connected_component_subgraphs(G), key=len) See Also -------- connected_components Notes ----- For undirected graphs only. Graph, node, and edge attributes are copied to the subgraphs by default. N(Rtsubgraphtcopy(R RR ((s|/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/components/connected.pyRGs&cCsttt|ƒƒƒS(s:Return the number of connected components. Parameters ---------- G : NetworkX graph An undirected graph. Returns ------- n : integer Number of connected components See Also -------- connected_components Notes ----- For undirected graphs only. (tlentlistR(R ((s|/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/components/connected.pyRtscCsXt|ƒdkr'tjddƒ‚nttt|t|jƒƒƒƒƒt|ƒkS(sÀReturn 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. Examples -------- >>> G = nx.path_graph(4) >>> print(nx.is_connected(G)) True See Also -------- connected_components Notes ----- For undirected graphs only. isConnectivity is undefined sfor the null graph.(RtnxtNetworkXPointlessConceptRRtnextt nodes_iter(R ((s|/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/components/connected.pyRs  cCstt||ƒƒS(sŒReturn the 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. See Also -------- connected_components Notes ----- For undirected graphs only. (RR(R tn((s|/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/components/connected.pyR°sccsutƒ}|h}x\|rp|}tƒ}x@|D]8}||kr1|V|j|ƒ|j||ƒq1q1WqWdS(sA fast BFS node generatorN(RtaddR (R tsourceR t nextlevelt thislevelR ((s|/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/components/connected.pyRÍs       (t__doc__tnetworkxRtnetworkx.utils.decoratorsRtjoint __authors__t__all__RtTrueRRRRR(((s|/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/components/connected.pyts     - , #