U ª9%e4ã@s8dZddlZddlmZmZdgZedƒddd„ƒZdS)zSemiconnectedness.éN)Únot_implemented_forÚpairwiseÚis_semiconnectedZ undirectedcsZtˆƒdkrt d¡‚t ˆ¡s$dSt ˆ¡‰|dkr@t ˆ¡}t‡fdd„t|ƒDƒƒS)aëReturns 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. topo_order: list or tuple, optional A topological order for G (if None, the function will compute one) 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 rz-Connectivity is undefined for the null graph.FNc3s|]\}}ˆ ||¡VqdS)N)Zhas_edge)Ú.0ÚuÚv©ÚG©úk/var/www/html/Darija-Ai-API/env/lib/python3.8/site-packages/networkx/algorithms/components/semiconnected.pyÚ @sz#is_semiconnected..)ÚlenÚnxZNetworkXPointlessConceptZis_weakly_connectedZ condensationZtopological_sortÚallr)r Z topo_orderr rr rs, ÿ   )N)Ú__doc__ZnetworkxrZnetworkx.utilsrrÚ__all__rr r r r Ús