o
    ˷e3                     @   sp   d Z ddlZddlmZ ddlmZ g dZeddd	 Zd
d Z	eddd Z
eddd Zdd ZdS )zConnected components.    N)not_implemented_for   )arbitrary_element)number_connected_componentsconnected_componentsis_connectednode_connected_componentdirectedc                 c   s8    t  }| D ]}||vrt| |}|| |V  qdS )a  Generate connected components.

    Parameters
    ----------
    G : NetworkX graph
       An undirected graph

    Returns
    -------
    comp : generator of sets
       A generator of sets of nodes, one for each component of G.

    Raises
    ------
    NetworkXNotImplemented
        If G is directed.

    Examples
    --------
    Generate a sorted list of connected components, largest first.

    >>> G = nx.path_graph(4)
    >>> nx.add_path(G, [10, 11, 12])
    >>> [len(c) for c in sorted(nx.connected_components(G), key=len, reverse=True)]
    [4, 3]

    If you only want the largest connected component, it's more
    efficient to use max instead of sort.

    >>> largest_cc = max(nx.connected_components(G), key=len)

    To create the induced subgraph of each component use:

    >>> S = [G.subgraph(c).copy() for c in nx.connected_components(G)]

    See Also
    --------
    strongly_connected_components
    weakly_connected_components

    Notes
    -----
    For undirected graphs only.

    N)set
_plain_bfsupdate)Gseenvc r   _/var/www/ideatree/venv/lib/python3.10/site-packages/networkx/algorithms/components/connected.pyr      s   /

r   c                 C   s   t dd t| D S )a  Returns the number of connected components.

    Parameters
    ----------
    G : NetworkX graph
       An undirected graph.

    Returns
    -------
    n : integer
       Number of connected components

    Examples
    --------
    >>> G = nx.Graph([(0, 1), (1, 2), (5, 6), (3, 4)])
    >>> nx.number_connected_components(G)
    3

    See Also
    --------
    connected_components
    number_weakly_connected_components
    number_strongly_connected_components

    Notes
    -----
    For undirected graphs only.

    c                 s       | ]}d V  qdS    Nr   ).0ccr   r   r   	<genexpr>d       z.number_connected_components.<locals>.<genexpr>)sumr   r   r   r   r   r   F   s   r   c                 C   s<   t | dkrtddtdd t| t| D t | kS )ag  Returns True if the graph is connected, False otherwise.

    Parameters
    ----------
    G : NetworkX Graph
       An undirected graph.

    Returns
    -------
    connected : bool
      True if the graph is connected, false otherwise.

    Raises
    ------
    NetworkXNotImplemented
        If G is directed.

    Examples
    --------
    >>> G = nx.path_graph(4)
    >>> print(nx.is_connected(G))
    True

    See Also
    --------
    is_strongly_connected
    is_weakly_connected
    is_semiconnected
    is_biconnected
    connected_components

    Notes
    -----
    For undirected graphs only.

    r   zConnectivity is undefined zfor the null graph.c                 s   r   r   r   )r   noder   r   r   r      r   zis_connected.<locals>.<genexpr>)lennxNetworkXPointlessConceptr   r   r   r   r   r   r   r   g   s
   &$r   c                 C   s
   t | |S )a  Returns the set of nodes in the component of graph containing node n.

    Parameters
    ----------
    G : NetworkX Graph
       An undirected graph.

    n : node label
       A node in G

    Returns
    -------
    comp : set
       A set of nodes in the component of G containing node n.

    Raises
    ------
    NetworkXNotImplemented
        If G is directed.

    Examples
    --------
    >>> G = nx.Graph([(0, 1), (1, 2), (5, 6), (3, 4)])
    >>> nx.node_connected_component(G, 0)  # nodes of component that contains node 0
    {0, 1, 2}

    See Also
    --------
    connected_components

    Notes
    -----
    For undirected graphs only.

    )r   )r   nr   r   r   r      s   
%r   c                 C   sR   | j }t }|h}|r'|}t }|D ]}||vr$|| |||  q|s|S )zA fast BFS node generator)adjr
   addr   )r   sourceG_adjr   	nextlevel	thislevelr   r   r   r   r      s   
r   )__doc__networkxr   networkx.utils.decoratorsr   utilsr   __all__r   r   r   r   r   r   r   r   r   <module>   s    
6!
,
'