ó ú£Õ\c@smdZdjddgƒZdddddgZd d lZd „Zd „Zd „Zd„Z d„Z d S(s Connected components. s s Eben Kenahs2Aric Hagberg (hagberg@lanl.gov)Christopher Ellisontnumber_connected_componentstconnected_componentstconnected_component_subgraphst is_connectedtnode_connected_componentiÿÿÿÿNcCsœ|jƒrtjdƒ‚ni}g}xU|D]M}||kr1tj||ƒ}|jt|jƒƒƒ|j|ƒq1q1W|jdt dt ƒ|S(s§Return nodes in connected components of graph. Parameters ---------- G : NetworkX Graph An undirected graph. Returns ------- comp : list of lists A list of nodes for each component of G. See Also -------- strongly_connected_components Notes ----- The list is ordered from largest connected component to smallest. For undirected graphs only. sgNot allowed for directed graph G. Use UG=G.to_undirected() to create an undirected graph.tkeytreverse( t is_directedtnxt NetworkXErrort"single_source_shortest_path_lengthtappendtlisttkeystupdatetsorttlentTrue(tGtseent componentstvtc((s`/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/components/connected.pyRs    cCstt|ƒƒS(sFReturn number of connected components in graph. Parameters ---------- G : NetworkX Graph An undirected graph. Returns ------- n : integer Number of connected components See Also -------- connected_components Notes ----- For undirected graphs only. (RR(R((s`/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/components/connected.pyR<scCsp|jƒrtjdƒ‚nt|ƒdkrBtjdƒ‚nttj|t|jƒƒƒƒt|ƒkS(sŸTest graph connectivity. 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. sYNot allowed for directed graph G. Use UG=G.to_undirected() to create an undirected graph.is-Connectivity is undefined for the null graph.(RRR RtNetworkXPointlessConceptR tnextt nodes_iter(R((s`/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/components/connected.pyRTs    cCsCt|ƒ}g}x*|D]"}|j|j|ƒjƒƒqW|S(sŒReturn connected components as subgraphs. Parameters ---------- G : NetworkX Graph An undirected graph. Returns ------- glist : list A list of graphs, one for each connected component of G. Examples -------- Get largest connected component as subgraph >>> G=nx.path_graph(4) >>> G.add_edge(5,6) >>> H=nx.connected_component_subgraphs(G)[0] See Also -------- connected_components Notes ----- The list is ordered from largest connected component to smallest. For undirected graphs only. Graph, node, and edge attributes are copied to the subgraphs. (RR tsubgraphtcopy(Rtcct graph_listR((s`/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/components/connected.pyR|s   cCs:|jƒrtjdƒ‚nttj||ƒjƒƒS(sœReturn nodes in connected components of graph containing node n. Parameters ---------- G : NetworkX Graph An undirected graph. n : node label A node in G Returns ------- comp : lists A list of nodes in component of G containing node n. See Also -------- connected_components Notes ----- For undirected graphs only. sgNot allowed for directed graph G. Use UG=G.to_undirected() to create an undirected graph.(RRR R R R (Rtn((s`/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/components/connected.pyR£s  ( t__doc__tjoint __authors__t__all__tnetworkxRRRRRR(((s`/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/components/connected.pyts     $  ( '