U 9v fa ã@sVdZddlZddlmZdddgZedƒdd„ƒZedƒd d„ƒZedƒd d„ƒZdS) zAttracting components.éN)Únot_implemented_forÚnumber_attracting_componentsÚattracting_componentsÚis_attracting_componentZ undirectedccs@tt |¡ƒ}t ||¡}|D]}| |¡dkr||VqdS)aáGenerates 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. To obtain induced subgraphs on each component use: ``(G.subgraph(c).copy() for c in attracting_components(G))`` 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 rN)ÚlistÚnxZstrongly_connected_componentsZ condensationZ out_degree)ÚGZsccZcGÚn©r úM/tmp/pip-unpacked-wheel-_lngutwb/networkx/algorithms/components/attracting.pyr s $ cCstdd„t|ƒDƒƒS)aœ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)éNr )Ú.0Úacr r r Ú Psz/number_attracting_components..)Úsumr)rr r r r7scCs0tt|ƒƒ}t|ƒdkr,t|dƒt|ƒkSdS)aÍ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 r rF)rrÚlen)rrr r r rSs  ) Ú__doc__ZnetworkxrZnetworkx.utils.decoratorsrÚ__all__rrrr r r r Ús ý *