Файловый менеджер - Редактировать - /opt/imh-python/lib/python3.9/site-packages/pygraph/functions/__pycache__/biconnected_components.cpython-39.pyc
Ðазад
a ^�h�* � @ s` d Z ddlmZmZ ddlmZ ddlmZ dd� Zd d � Z d d � Z d d� Z dd� Z dd� Z dS )z8Implements functionality to find biconnected components.� )�deque� defaultdict� )�%get_connected_components_as_subgraphs� )�get_subgraph_from_edge_listc C s, g }t | �}|D ]}t|�}|�|� q|S )z�Finds all the biconnected components in a graph. Returns a list of lists, each containing the edges that form a biconnected component. Returns an empty list for an empty graph. )r �/_internal_get_biconnected_components_edge_lists�extend)�graph�list_of_components� components� component� edge_list� r ��/root/rpmbuild/BUILDROOT/imh-python39-modules-3.9.7-92.el8.x86_64/opt/imh-python/lib/python3.9/site-packages/pygraph/functions/biconnected_components.py�find_biconnected_components s r c C s. g }t | �}|D ]}t| |�}|�|� q|S )z?Finds the biconnected components and returns them as subgraphs.)r r �append)r Zlist_of_graphsr r Zsubgraphr r r �(find_biconnected_components_as_subgraphs s r c C sD g }| � � }t|�dkr |S t| �}|D ]}t|�}|�|� q(|S )z�Finds all of the articulation vertices within a graph. Returns a list of all articulation vertices within the graph. Returns an empty list for an empty graph. r )�get_all_node_ids�lenr � _internal_get_cut_vertex_listr )r Zarticulation_verticesZ all_nodesr r Z vertex_listr r r �find_articulation_vertices( s r c C sH g }| � � }| �� }|dkr6|dkr2|�| �� � |S d}t� }t� }tdd� �}tdd� �}i } i } tdd� �} tdd� �} t| �� �} t| �dk�rD| � � }|||< |d | � |�d �}|� |� t|�dkr�|� � }|d }|d }|| �sP|| v �r| � |� d ||< |d7 }|| |< | | | |< t|d �dk�rP|d � � }||d < |d u �r\q�| | �s| �|�}|d D ]L}| �|�}||f}||f}||d k�s�||d k�rx|� |� �qƐqx|||< d | |< |� |� |d | � |�d �}|� |� qĐn| | �sr||| k�rr| | | | k�rRt| |||�}t|�dk�rR|�|� t| | | | �| |< d | |< n�|| �r|| |k�r| | | | k �r| �|�}|d D ]L}| �|�}||f}||f}||d k�s�||d k�r�|� |� �q��q�t| | | | �| |< t|d �dkr�|d � � }||d < |� |� q�q�|S )a� Works on a single connected component to produce the edge lists of the biconnected components. Returns a list of lists, each containing the edges that combine to produce the connected component. Returns a single nested list with 1 edge if there is only 1 edge in the graph (a 2-node graph is a special case, generally considered to be a biconnected graph). Returns an empty list if there are no edges in the graph (i.e. if it's a single-node or empty graph). r r r c S s dS �NFr r r r r �<lambda>S � zA_internal_get_biconnected_components_edge_lists.<locals>.<lambda>c S s d S �Nr r r r r r T r c S s dS r r r r r r r W r c S s dS r r r r r r r X r N��u�v�remaining_childrenr r Tr �edges�vertices)� num_nodes� num_edgesr Zget_all_edge_idsr r �setr r �pop� neighbors� appendleft�popleft�removeZget_node�get_edge�output_component�min)r r r" r# � dfs_count� edge_stack� dfs_stack�visited�parent�depth�low�preorder_processed�postorder_processed�unvisited_nodesr � stack_frame�framer Znode_v�edge_id�edge�tpl_a�tpl_b� new_framer r r r r @ s� � � * r c C s\ g }t |�dkrX|�� }|�|� | �|�}||f}||f}||d ksX||d krqXq|S )zFHelper function to pop edges off the stack and produce a list of them.r r! )r r( r r* ) r r. r r r r9 r: r; r< r r r r+ � s r+ c C s� t � }| �� dkrt|�S d}d}t� }tdd� �}tdd� �}tdd� �}i }i } tdd� �} tdd� �} t | �� �} t| �dk�rn| �� } | || < | d | �| �d �}|� |� t|�dkrx|� � }|d } |d }|| �s<| | v r�| � | � d || < |d7 }||| < || | | < t|d �dk�r<|d �� }||d < |d u �rHq�| | �s�| ||< || � |� d | |< |� |� |d | �|�d �}|� |� q�n�| | �s�| || k�r�| | || k�r�|| dk�r�|� | � t| | | | �| | < d | |< n@|| �r<|| |k�r<|| || k �r<t| | || �| | < t|d �dkr�|d �� }||d < |� |� q�qxt|| �dk�r�t|�� �D ]$\}}||k�r�|� |� �q��q�t|�S )z�Works on a single connected component to produce the node list of cut vertices. Returns a list of nodes. Returns an empty list if there are no nodes in the graph (i.e. if it's an empty graph). r r c S s dS r r r r r r r � r z/_internal_get_cut_vertex_list.<locals>.<lambda>c S s d S r r r r r r r � r c S s g S r r r r r r r � r c S s dS r r r r r r r � r c S s dS r r r r r r r � r Nr r r Tr )r$ r" �listr r r r r% r& r' r( r) r �addr, �items)r Zlist_of_cut_verticesr- Zroot_dfs_countr/ r0 r1 �childrenr2 r3 r4 r5 r6 r r7 r8 r r= Znode_id�dfsr r r r � s� � � * r N)�__doc__� collectionsr r Zconnected_componentsr Zhelpersr r r r r r+ r r r r r �<module> s s
| ver. 1.1 | |
.
| PHP 8.3.30 | Ð“ÐµÐ½ÐµÑ€Ð°Ñ†Ð¸Ñ Ñтраницы: 0 |
proxy
|
phpinfo
|
ÐаÑтройка