+ j Rt^RIt^RIHt.ROt]!R4]P R44t]!R4]P R44t]!R4]P R44t R#)zAttracting components.N)not_implemented_for undirectedc#"\\P!V44p\P!W4pVF%pVP V4^8XgKW,xK' R#5i)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 N)listnxstrongly_connected_components condensation out_degree)GscccGns& j/home/luca/screen-checking/.venv/lib/python3.14/site-packages/networkx/algorithms/components/attracting.pyattracting_componentsr sMJ r//2 3C  B  == q &Ls AA%A%c8\R\V444#)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&"TFp^xK R#5i)N).0acs& r /number_attracting_components..Ss43Rq3s)sumr)r s&rnumber_attracting_componentsr9s4 4034 44c\\V44p\V4^8Xd\V^,4\V48H#R#)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 F)rrlen)r rs& ris_attracting_componentrVs94 #A& 'B 2w!|2a5zSV## r)rrr) __doc__networkxrnetworkx.utils.decoratorsr__all__ _dispatchablerrrrrrr#s9 \"'#'T\"5#56\"#r