Файловый менеджер - Редактировать - /opt/imh-python/lib/python3.9/site-packages/tests/__pycache__/test_spanning_tree.cpython-39.pyc
Ðазад
a ^�hY � @ sF d Z ddlZddlmZmZmZmZ ddlmZ G dd� dej �Z dS ) zZProvides unit tests to verify that the spanning tree algorithms are functioning correctly.� N� )�UndirectedGraph�find_minimum_spanning_tree� find_minimum_spanning_forest�DisconnectedGraphError� )�utility_functionsc @ sL e Zd Zdd� Zdd� Zdd� Zdd� Zd d � Zd d � Zd d� Z dd� Z dS )�MSTTestc C s" t � }g }t|�}| �||� dS )zYDoes the ''find_minimum_spanning_tree'' function return an empty list for an empty graph?N)r r � assertEqual��self�graph�expected�mst� r ��/root/rpmbuild/BUILDROOT/imh-python39-modules-3.9.7-92.el8.x86_64/opt/imh-python/lib/python3.9/site-packages/tests/test_spanning_tree.py�test_mst_with_empty_graph s z!MSTTest.test_mst_with_empty_graphc C s$ t �� }g }t|�}| �||� dS )z^Does the ''find_minimum_spanning_tree'' function return an empty list for a single-node graph?N)r Zbuild_single_node_graphr r r r r r � test_mst_with_single_node_graph s z'MSTTest.test_mst_with_single_node_graphc C s t �� }dg}t|�}dS )zYDoes the ''find_minimum_spanning_tree'' function return a single edge for a 2-node graph?r N)r Zbuild_2_node_graphr r r r r �test_mst_with_2_node_graph s z"MSTTest.test_mst_with_2_node_graphc C s0 t �� }ddg}t|�}|�� | �||� dS )z|Does the ''find_minimum_spanning_tree'' function return the proper 2 edges for a triangle graph with costs? r r N)r Z build_triangle_graph_with_costsr �sortr r r r r � test_mst_with_triangle_graph# s z$MSTTest.test_mst_with_triangle_graphc C s0 t �� }g d�}t|�}|�� | �||� dS )ziDoes the ''find_minimum_spanning_tree'' function return the proper 3 edges for a square graph with costs?)r � � N)r Z"build_square_test_graph_with_costsr r r r r r r �"test_mst_with_costing_square_graph/ s z*MSTTest.test_mst_with_costing_square_graphc C s0 t �� }g d�}t|�}|�� | �||� dS )z^Does the ''find_minimum_spanning_tree'' function return the unique mst for a particular graph?)r r � � � � N)r Z)build_complicated_test_graph_with_one_mstr r r r r r r �test_mst_with_unique_mst9 s z MSTTest.test_mst_with_unique_mstc C s6 t �� }z t|� W n ty& Y n 0 | �d� dS )zYDoes the ''find_minimum_spanning_tree'' function throw an error for a disconnected graph?zNfind_minimum_spanning_tree function accepts a disconnected graph without errorN)r � build_disconnected_test_graphr r Zfail)r r r r r �$test_mst_with_disconnected_subgraphsC s z,MSTTest.test_mst_with_disconnected_subgraphsc C s( t �� }d}t|�}| �|t|�� dS )zaDoes the ''find_minimum_spanning_forest'' function return multiple msts for a disconnected graph?r N)r r r r �len)r r Zexpected_lengthr r r r �$test_msf_with_disconnected_subgraphsN s z,MSTTest.test_msf_with_disconnected_subgraphsN) �__name__� __module__� __qualname__r r r r r r r r" r r r r r s r ) �__doc__ZunittestZpygraphr r r r � r ZTestCaser r r r r �<module> s
| ver. 1.1 | |
.
| PHP 8.3.30 | Ð“ÐµÐ½ÐµÑ€Ð°Ñ†Ð¸Ñ Ñтраницы: 0 |
proxy
|
phpinfo
|
ÐаÑтройка