ķ ,ĩ[c@s›dZddlZddlZddlmZddddgZedƒd „ƒZedƒd „ƒZ edƒd „ƒZ edƒe d „ƒZ dS( sAttracting components.i˙˙˙˙N(tnot_implemented_fortnumber_attracting_componentstattracting_componentstis_attracting_componenttattracting_component_subgraphst undirectedccs]ttj|ƒƒ}tj||ƒ}x/|D]'}|j|ƒdkr.||Vq.q.WdS(sjGenerates the attracting components in `G`. An attracting component in a directed graph `G` is a strongly connected component with the property that a random walker on the graph will never leave the component, once it enters the component. The nodes in attracting components can also be thought of as recurrent nodes. If a random walker enters the attractor containing the node, then the node will be visited infinitely often. Parameters ---------- G : DiGraph, MultiDiGraph The graph to be analyzed. Returns ------- attractors : generator of sets A generator of sets of nodes, one for each attracting component of G. Raises ------ NetworkXNotImplemented : If the input graph is undirected. See Also -------- number_attracting_components is_attracting_component iN(tlisttnxtstrongly_connected_componentst condensationt out_degree(tGtscctcGtn((sHlib/python2.7/site-packages/networkx/algorithms/components/attracting.pyRs ! cCstd„t|ƒDƒƒS(sžReturns the number of attracting components in `G`. Parameters ---------- G : DiGraph, MultiDiGraph The graph to be analyzed. Returns ------- n : int The number of attracting components in G. Raises ------ NetworkXNotImplemented : If the input graph is undirected. See Also -------- attracting_components is_attracting_component css|] }dVqdS(iN((t.0tac((sHlib/python2.7/site-packages/networkx/algorithms/components/attracting.pys Ws(tsumR(R ((sHlib/python2.7/site-packages/networkx/algorithms/components/attracting.pyR>scCsBtt|ƒƒ}t|ƒdkr>t|dƒt|ƒkStS(sĪReturns True if `G` consists of a single attracting component. Parameters ---------- G : DiGraph, MultiDiGraph The graph to be analyzed. Returns ------- attracting : bool True if `G` has a single attracting component. Otherwise, False. Raises ------ NetworkXNotImplemented : If the input graph is undirected. See Also -------- attracting_components number_attracting_components ii(RRtlentFalse(R R((sHlib/python2.7/site-packages/networkx/algorithms/components/attracting.pyRZsccs\d}tj|tƒx?t|ƒD]1}|rF|j|ƒjƒVq#|j|ƒVq#WdS(s–DEPRECATED: Use ``(G.subgraph(c) for c in attracting_components(G))`` Or ``(G.subgraph(c).copy() for c in attracting_components(G))`` s„attracting_component_subgraphs is deprecated and will be removedin 2.2. Use (G.subgraph(c).copy() for c in attracting_components(G))N(t _warningstwarntDeprecationWarningRtsubgraphtcopy(R Rtmsgtc((sHlib/python2.7/site-packages/networkx/algorithms/components/attracting.pyRys ( t__doc__twarningsRtnetworkxRtnetworkx.utils.decoratorsRt__all__RRRtTrueR(((sHlib/python2.7/site-packages/networkx/algorithms/components/attracting.pyt s   (