ó ,µ[c@sJdZddlZddlmZmZdgZedƒd„ƒZdS(sSemiconnectedness.iÿÿÿÿN(tnot_implemented_fortpairwisetis_semiconnectedt undirectedcsutˆƒdkr$tjdƒ‚ntjˆƒs7tStjˆƒ‰tjˆƒ}t‡fd†t|ƒDƒƒS(suReturn True if the graph is semiconnected, False otherwise. A graph is semiconnected if, and only if, for any pair of nodes, either one is reachable from the other, or they are mutually reachable. Parameters ---------- G : NetworkX graph A directed graph. Returns ------- semiconnected : bool True if the graph is semiconnected, False otherwise. Raises ------ NetworkXNotImplemented : If the input graph is undirected. NetworkXPointlessConcept : If the graph is empty. Examples -------- >>> G=nx.path_graph(4,create_using=nx.DiGraph()) >>> print(nx.is_semiconnected(G)) True >>> G=nx.DiGraph([(1, 2), (3, 2)]) >>> print(nx.is_semiconnected(G)) False See Also -------- is_strongly_connected is_weakly_connected is_connected is_biconnected is-Connectivity is undefined for the null graph.c3s'|]\}}ˆj||ƒVqdS(N(thas_edge(t.0tutv(tG(sKlib/python2.7/site-packages/networkx/algorithms/components/semiconnected.pys Cs( tlentnxtNetworkXPointlessConcepttis_weakly_connectedtFalset condensationttopological_sorttallR(Rtpath((RsKlib/python2.7/site-packages/networkx/algorithms/components/semiconnected.pyRs) (t__doc__tnetworkxR tnetworkx.utilsRRt__all__R(((sKlib/python2.7/site-packages/networkx/algorithms/components/semiconnected.pyt s