ķ |Ŗ*^c@sĒdZddlZddlmZdjdgƒZdddd gZed ƒd „ƒZed ƒd „ƒZ ed ƒe d „ƒZ ed ƒd„ƒZ d„Z dS(sWeakly connected components. i˙˙˙˙N(tnot_implemented_fors s2Aric Hagberg (hagberg@lanl.gov)Christopher Ellisont"number_weakly_connected_componentstweakly_connected_componentst$weakly_connected_component_subgraphstis_weakly_connectedt undirectedccsTtƒ}xD|D]<}||krtt||ƒƒ}|V|j|ƒqqWdS(smGenerate weakly connected components of G. Parameters ---------- G : NetworkX graph A directed graph Returns ------- comp : generator of sets A generator of sets of nodes, one for each weakly connected component of G. Examples -------- Generate a sorted list of weakly connected components, largest first. >>> G = nx.path_graph(4, create_using=nx.DiGraph()) >>> G.add_path([10, 11, 12]) >>> [len(c) for c in sorted(nx.weakly_connected_components(G), ... key=len, reverse=True)] [4, 3] If you only want the largest component, it's more efficient to use max instead of sort. >>> largest_cc = max(nx.weakly_connected_components(G), key=len) See Also -------- strongly_connected_components Notes ----- For directed graphs only. N(tsett _plain_bfstupdate(tGtseentvtc((sƒ/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/components/weakly_connected.pyRs '   cCsttt|ƒƒƒS(sJReturn the number of weakly connected components in G. Parameters ---------- G : NetworkX graph A directed graph. Returns ------- n : integer Number of weakly connected components See Also -------- connected_components Notes ----- For directed graphs only. (tlentlistR(R ((sƒ/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/components/weakly_connected.pyRHsccsFx?t|ƒD]1}|r0|j|ƒjƒVq |j|ƒVq WdS(s"Generate weakly connected components as subgraphs. Parameters ---------- G : NetworkX graph A directed graph. copy: bool (default=True) If True make a copy of the graph attributes Returns ------- comp : generator A generator of graphs, one for each weakly connected component of G. Examples -------- Generate a sorted list of weakly connected components, largest first. >>> G = nx.path_graph(4, create_using=nx.DiGraph()) >>> G.add_path([10, 11, 12]) >>> [len(c) for c in sorted(nx.weakly_connected_component_subgraphs(G), ... key=len, reverse=True)] [4, 3] If you only want the largest component, it's more efficient to use max instead of sort. >>> Gc = max(nx.weakly_connected_component_subgraphs(G), key=len) See Also -------- strongly_connected_components connected_components Notes ----- For directed graphs only. Graph, node, and edge attributes are copied to the subgraphs by default. N(Rtsubgraphtcopy(R Rtcomp((sƒ/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/components/weakly_connected.pyRbs+cCsJt|ƒdkr$tjdƒ‚nttt|ƒƒdƒt|ƒkS(s Test directed graph for weak connectivity. A directed graph is weakly connected if, and only if, the graph is connected when the direction of the edge between nodes is ignored. Parameters ---------- G : NetworkX Graph A directed graph. Returns ------- connected : bool True if the graph is weakly connected, False otherwise. See Also -------- is_strongly_connected is_semiconnected is_connected Notes ----- For directed graphs only. is-Connectivity is undefined for the null graph.(R tnxtNetworkXPointlessConceptRR(R ((sƒ/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/components/weakly_connected.pyR”s ccs˜|j}|j}tƒ}|h}xm|r“|}tƒ}xQ|D]I}||krC|V|j|ƒ|j||ƒ|j||ƒqCqCWq'WdS(swA fast BFS node generator The direction of the edge between nodes is ignored. For directed graphs only. N(tsucctpredRtaddR(R tsourcetGsucctGpredR t nextlevelt thislevelR ((sƒ/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/components/weakly_connected.pyRˇs         (t__doc__tnetworkxRtnetworkx.utils.decoratorsRtjoint __authors__t__all__RRtTrueRRR(((sƒ/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/components/weakly_connected.pyts  / 1#