ó ,µ[c@sĄdZddlZddlZddlmZddlmZdddd d gZ ed ƒd „ƒZ ed ƒe d „ƒZ d„Z ed ƒd„ƒZed ƒd„ƒZd„ZdS(sConnected components.i’’’’N(tnot_implemented_fori(tarbitrary_elementtnumber_connected_componentstconnected_componentstconnected_component_subgraphst is_connectedtnode_connected_componenttdirectedccsTtƒ}xD|D]<}||krtt||ƒƒ}|V|j|ƒqqWdS(svGenerate 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) See Also -------- strongly_connected_components weakly_connected_components Notes ----- For undirected graphs only. N(tsett _plain_bfstupdate(tGtseentvtc((sGlib/python2.7/site-packages/networkx/algorithms/components/connected.pyRs +   ccs\d}tj|tƒx?t|ƒD]1}|rF|j|ƒjƒVq#|j|ƒVq#WdS(s”DEPRECATED: Use ``(G.subgraph(c) for c in connected_components(G))`` Or ``(G.subgraph(c).copy() for c in connected_components(G))`` s‚connected_component_subgraphs is deprecated and will be removedin 2.2. Use (G.subgraph(c).copy() for c in connected_components(G))N(t _warningstwarntDeprecationWarningRtsubgraphtcopy(R RtmsgR((sGlib/python2.7/site-packages/networkx/algorithms/components/connected.pyRNs cCstd„t|ƒDƒƒ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 number_weakly_connected_components number_strongly_connected_components Notes ----- For undirected graphs only. css|] }dVqdS(iN((t.0tcc((sGlib/python2.7/site-packages/networkx/algorithms/components/connected.pys vs(tsumR(R ((sGlib/python2.7/site-packages/networkx/algorithms/components/connected.pyR^scCsVt|ƒdkr'tjddƒ‚ntd„t|t|ƒƒDƒƒt|ƒkS(sgReturn 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. isConnectivity is undefined sfor the null graph.css|] }dVqdS(iN((Rtnode((sGlib/python2.7/site-packages/networkx/algorithms/components/connected.pys ¢s(tlentnxtNetworkXPointlessConceptRR R(R ((sGlib/python2.7/site-packages/networkx/algorithms/components/connected.pyRys&  cCstt||ƒƒS(sąReturn 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. See Also -------- connected_components Notes ----- For undirected graphs only. (RR (R tn((sGlib/python2.7/site-packages/networkx/algorithms/components/connected.pyR„sccs~|j}tƒ}|h}x\|ry|}tƒ}x@|D]8}||kr:|V|j|ƒ|j||ƒq:q:WqWdS(sA fast BFS node generatorN(tadjRtaddR (R tsourcetG_adjR t nextlevelt thislevelR ((sGlib/python2.7/site-packages/networkx/algorithms/components/connected.pyR Ēs        (t__doc__twarningsRtnetworkxRtnetworkx.utils.decoratorsRtutilsRt__all__RtTrueRRRRR (((sGlib/python2.7/site-packages/networkx/algorithms/components/connected.pyt s    3  ,"