Файловый менеджер - Редактировать - /opt/imh-python/lib/python3.9/site-packages/tests/__pycache__/test_merge_graphs.cpython-39.pyc
Ðазад
a ^�h� � @ sJ d Z ddlZddlZddlmZmZmZ ddlmZ G dd� dej �Z dS ) zXProvides unit tests to verify that the graph merging algorithm is functioning correctly.� N� )�UndirectedGraph� merge_graphs�build_triangle_graph� )�utility_functionsc @ s< e Zd Zdd� Zdd� Zdd� Zdd� Zd d � Zd d � Zd S )�MergeGraphsTestc C sZ t � }t � }t||�\}}| �i |� | �i |� | �dt|j�� | �dt|j�� dS )zQDoes the ''merge_graphs'' function return an empty graph when given empty graphs?r N)r r � assertEqual�len�nodes�edges)�self� main_graph�addition_graph�node_map�edge_map� r ��/root/rpmbuild/BUILDROOT/imh-python39-modules-3.9.7-92.el8.x86_64/opt/imh-python/lib/python3.9/site-packages/tests/test_merge_graphs.py�test_empty_graphs s z!MergeGraphsTest.test_empty_graphsc C s t �� }t�|�}t� }t||�\}}| �i |� | �i |� | �t|�� �t|�� �� | �t|� � �t|� � �� |�� D ]R}|� |�}|� |�}| �t|d �t|d �� |d D ]} | � | |d � q�q~|� � D ],} |� | �} |� | �} | �| d | d � q�dS )zsDoes the ''merge_graphs'' function return a duplicate of the main graph when given an empty addition graph?r �verticesN) r �build_simple_test_graph�copy�deepcopyr r r r �get_all_node_ids�get_all_edge_ids�get_node�assertIn�get_edge) r �original_graphr r r r �node_id� original_node�new_node�edge_id� original_edge�new_edger r r �test_empty_addition_graph s$ z)MergeGraphsTest.test_empty_addition_graphc C s: t �� }t� }t�|�}t||�\}}tdd� |�� D ��}tdd� |�� D ��}| � ||� | � ||� | � t |�� �t |�� �� | � t |�� �t |�� �� |�� D ]R}|� |�} |� |�} | � t | d �t | d �� | d D ]} | � | | d � q�q�|�� D ].} |� | �} |� | �} | � | d | d � �qdS )zsDoes the ''merge_graphs'' function return a duplicate of the addition graph when given an empty main graph?c S s g | ] }||f�qS r r )�.0r r r r � <listcomp>J � z9MergeGraphsTest.test_empty_main_graph.<locals>.<listcomp>c S s g | ] }||f�qS r r )r& r" r r r r' K r( r r N)r r r r r r �dictr r r r r r r )r r r r r r Zexpected_node_mapZexpected_edge_mapr r r! r" r# r$ r r r �test_empty_main_graph@ s( z%MergeGraphsTest.test_empty_main_graphc C s t �� }t� }| �||� dS �z|Does the ''merge_graphs'' function produce a combined graph that maintains the correct topology for both components?N)r Zbuild_2_node_graphr � graph_copy_integrity_checker�r r r r r r �test_simple_graph_copyh s z&MergeGraphsTest.test_simple_graph_copyc C s t �� }t� }| �||� dS r+ )r Z"build_fully_biconnected_test_graphr r, r- r r r �test_complex_graph_copyp s z'MergeGraphsTest.test_complex_graph_copyc C s� t �|�}t||�\}}t|�� �t|�� � }t|�� �t|�� � }| �|t|�� �� | �|t|�� �� |�� D ]R}|�|�} |�|�} | �t| d �t| d �� | d D ]} | �| | d � q�qx|�� D ],} |� | �} |� | �} | �| d | d � q�|�� D ]^}|�|�} |�|| �} | �t| d �t| d �� | d D ]} | �|| | d � �qJ�q |�� D ]J} |� | �} |� || �} | d \}}|| || f}| �|| d � �qrdS )z7Utility function to test the integrity of a graph copy.r r N) r r r r r r r r r r )r r r r r r Zexpected_node_countZexpected_edge_countr r r! r" r# r$ Zoriginal_vertex_aZoriginal_vertex_bZmapped_new_verticesr r r r, x s8 z,MergeGraphsTest.graph_copy_integrity_checkerN) �__name__� __module__� __qualname__r r% r* r. r/ r, r r r r r s &(r ) �__doc__Zunittestr Zpygraphr r r � r ZTestCaser r r r r �<module> s
| ver. 1.1 | |
.
| PHP 8.3.30 | Ð“ÐµÐ½ÐµÑ€Ð°Ñ†Ð¸Ñ Ñтраницы: 0 |
proxy
|
phpinfo
|
ÐаÑтройка