~i SrSSKrSSKJr /SQr\"S5\R S55r\"S5\R S55r\"S5\R S55r g) zAttracting components.N)not_implemented_for)number_attracting_componentsattracting_componentsis_attracting_component undirectedc## [[R"U55n[R"X5nUH nUR U5S:XdMXv M" g7f)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)listnxstrongly_connected_components condensation out_degree)GscccGns f/home/mande/repo/quber/.venv/lib/python3.13/site-packages/networkx/algorithms/components/attracting.pyrr sMJ r//2 3C  B  == q &Ls AA Ac8[S[U555$)aXReturns 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 c3&# UHnSv M g7f)N).0acs r /number_attracting_components..Ss43Rq3s)sumr)rs rrr9s4 4034 44c~[[U55n[U5S:Xa[US5[U5:H$g)aReturns 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 rrF)r rlen)rrs rrrVs94 #A& 'B 2w!|2a5zSV## r) __doc__networkxr networkx.utils.decoratorsr__all__ _dispatchablerrrrrrr$s9 \"'#'T\"5#56\"#r