ó ú£Õ\c@s^dZddlZdjdgƒZddddgZd „Zd „Zd „Zd „Z dS( s Attracting components. iÿÿÿÿNs sChristopher Ellisontnumber_attracting_componentstattracting_componentstis_attracting_componenttattracting_component_subgraphscCsmtj|ƒ}tj||ƒ}g|D]%}|j|ƒdkr(||^q(}|jdtdtƒ|S(sWReturns a list of 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 : list The list of attracting components, sorted from largest attracting component to smallest attracting component. See Also -------- number_attracting_components is_attracting_component attracting_component_subgraphs itkeytreverse(tnxtstrongly_connected_componentst condensationt out_degreetsorttlentTrue(tGtscctcGtnt attractors((sa/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/components/attracting.pyRs 2cCstt|ƒƒ}|S(scReturns 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. See Also -------- attracting_components is_attracting_component attracting_component_subgraphs (R R(R R((sa/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/components/attracting.pyR7scCs;t|ƒ}t|dƒt|ƒkr1t}nt}|S(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. See Also -------- attracting_components number_attracting_components attracting_component_subgraphs i(RR R tFalse(R tact attracting((sa/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/components/attracting.pyROs   cCs2gt|ƒD]}|j|ƒjƒ^q }|S(sèReturns a list of attracting component subgraphs from `G`. Parameters ---------- G : DiGraph, MultiDiGraph The graph to be analyzed. Returns ------- subgraphs : list A list of node-induced subgraphs of the attracting components of `G`. Notes ----- Graph, node, and edge attributes are copied to the subgraphs. See Also -------- attracting_components number_attracting_components is_attracting_component (Rtsubgraphtcopy(R Rt subgraphs((sa/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/components/attracting.pyRks.( t__doc__tnetworkxRtjoint __authors__t__all__RRRR(((sa/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/components/attracting.pyts   $