Файловый менеджер - Редактировать - /opt/imh-python/lib/python3.9/site-packages/tests/__pycache__/test_dfs.cpython-39.pyc
Ðазад
a ^�h] � @ sN d Z ddlZddlmZ ddlmZmZmZ ddlm Z G dd � d ej �Z dS ) z_Provides unit tests to verify that the Breadth First Search algorithm is functioning correctly.� N)� defaultdict� )�UndirectedGraph�depth_first_search�get_connected_components� )�utility_functionsc @ s< e Zd Zdd� Zdd� Zdd� Zdd� Zd d � Zd d � Zd S )�DepthFirstSearchTestc C s" t � }g }t|�}| �||� dS )zQDoes the ''depth_first_search'' function return an empty list for an empty graph?N)r r � assertEqual��self�graph�expected�ordering� r �~/root/rpmbuild/BUILDROOT/imh-python39-modules-3.9.7-92.el8.x86_64/opt/imh-python/lib/python3.9/site-packages/tests/test_dfs.py�test_dfs_with_empty_graph s z.DepthFirstSearchTest.test_dfs_with_empty_graphc C s& t �� }dg}t|�}| �||� dS )zYDoes the ''depth_first_search'' function return a single node when given a trivial graph?r N)r Zbuild_single_node_graphr r r r r r �test_dfs_with_single_node s z.DepthFirstSearchTest.test_dfs_with_single_nodec C s* t �� }g d�}t|d�}| �||� dS )zQDoes the ''depth_first_search'' function return the proper path for a line-graph?)r r � r N)r Zbuild_3_node_line_graphr r r r r r �test_dfs_with_line_graph s z-DepthFirstSearchTest.test_dfs_with_line_graphc s� t �� }t|d�}tttttdt|�d ��|���}tt|ttdt|�d ����}tdd� ��t |�� � fdd�}|dd� D ]V\}}d�|< ||d }|||�r�|� |�} t �fd d �| D ��} | r�| � || � q�dS ) zKDoes the ''depth_first_search'' function return nodes in a proper ordering?r c S s dS �NFr r r r r �<lambda>0 � z>DepthFirstSearchTest.test_dfs_depth_ordering.<locals>.<lambda>c s" � D ]}| |v r||v S qdS r r )Znode_aZnode_b� component)�connected_componentsr r �in_same_component7 s zGDepthFirstSearchTest.test_dfs_depth_ordering.<locals>.in_same_componentN���Tc s g | ]}� | �qS r r )�.0�n)�visited_by_noder r � <listcomp>B r z@DepthFirstSearchTest.test_dfs_depth_ordering.<locals>.<listcomp>) r � build_biconnected_test_graphr �dict�list�zip�range�lenr r Z neighbors�any�assertIn) r r r Znode_lookup_by_indexZitems_sorted_by_dfs_indexr Znode_idZ dfs_indexZsuccessor_node_idZneighbor_nodesZhas_unvisited_neighborsr )r r r �test_dfs_depth_ordering' s $ z,DepthFirstSearchTest.test_dfs_depth_orderingc C sH t �� }|�� }t|d�}| �t|�t|�� |D ]}| �||� q2dS )zTDoes the ''depth_first_search'' function return all the nodes for a connected graph?r N)r r! �get_all_node_idsr r r& r( �r r Z all_nodesr r r r r �0test_dfs_with_connected_graph_contains_all_nodesF s zEDepthFirstSearchTest.test_dfs_with_connected_graph_contains_all_nodesc C sH t �� }|�� }t|d�}| �t|�t|�� |D ]}| �||� q2dS )zWDoes the ''depth_first_search'' function return all the nodes for a disconnected graph?r N)r Z build_disconnected_test_graphr* r r r& r( r+ r r r �3test_dfs_with_disconnected_graph_contains_all_nodesR s zHDepthFirstSearchTest.test_dfs_with_disconnected_graph_contains_all_nodesN) �__name__� __module__� __qualname__r r r r) r, r- r r r r r s r ) �__doc__Zunittest� collectionsr Zpygraphr r r � r ZTestCaser r r r r �<module> s
| ver. 1.1 | |
.
| PHP 8.3.30 | Ð“ÐµÐ½ÐµÑ€Ð°Ñ†Ð¸Ñ Ñтраницы: 0 |
proxy
|
phpinfo
|
ÐаÑтройка