Файловый менеджер - Редактировать - /opt/imh-python/lib/python3.9/site-packages/tests/__pycache__/test_undirected_graph.cpython-39.pyc
Ðазад
a ^�h, � @ sB d Z ddlZddlmZmZmZ ddlmZ G dd� dej�Z dS ) zOProvides unit testing of the UndirectedGraph class in the main graphlib module.� N� )�UndirectedGraph�NonexistentNodeError�NonexistentEdgeError� )�utility_functionsc @ sT e Zd Zdd� Zdd� Zdd� Zdd� Zd d � Zd d � Zd d� Z dd� Z dd� Z dS )�UDGTestc C s t � }d}d}z|�||� W n ty0 Y n0 | �d�||�� |�� }z|�||� W n tyn Y n0 | �d�|�� |�� }|�|� z|�||� W n ty� Y n0 | �d�|�� |�� }z|�||� W n ty� | �d� Y n0 dS )zBDoes the ''new_edge'' method raise an error with invalid node ids?r r z,New edge accepts invalid node ids "{}", "{}"z(New edge accepts an invalid node id "{}"z/New edge throws error when given existing nodesN)r �new_edger �fail�format�new_nodeZ delete_node)�self�graph�node_a�node_b� r ��/root/rpmbuild/BUILDROOT/imh-python39-modules-3.9.7-92.el8.x86_64/opt/imh-python/lib/python3.9/site-packages/tests/test_undirected_graph.py�(test_new_edge_with_bad_node_raises_error s6 z0UDGTest.test_new_edge_with_bad_node_raises_errorc C s0 t � }|�� }|�� }|�||�}| �|� dS )z/Does the ''new_edge'' method return an edge id?N)r r r ZassertIsNotNone)r r r r �edge_idr r r �test_new_edge_return_value5 s z"UDGTest.test_new_edge_return_valuec C s@ t � }d}z|�|� W n ty* Y n0 | �d�|�� dS )zSDoes the ''delete_edge_by_id'' method raise an error when given an invalid edge id?r z+Delete edge accepts an invalid edge id "{}"N)r Zdelete_edge_by_idr r r �r r r r r r �+test_delete_edge_with_bad_edge_raises_error@ s z3UDGTest.test_delete_edge_with_bad_edge_raises_errorc C s@ t � }d}z|�|� W n ty* Y n0 | �d�|�� dS )zJDoes the ''get_node'' method raise an error when given an invalid node id?r z(Get node accepts an invalid node id "{}"N)r Zget_noder r r )r r �node_idr r r �(test_get_node_with_bad_node_raises_errorM s z0UDGTest.test_get_node_with_bad_node_raises_errorc C s@ t � }d}z|�|� W n ty* Y n0 | �d�|�� dS )zJDoes the ''get_edge'' method raise an error when given an invalid edge id?r z(Get edge accepts an invalid edge id "{}"N)r Zget_edger r r r r r r �(test_get_edge_with_bad_edge_raises_errorZ s z0UDGTest.test_get_edge_with_bad_edge_raises_errorc C sn t �� }dddgfdddgfdg fddgfddgfddgfddgfg}|D ] \}}|�|�}| �||� qJdS ) z_Does the ''neighbors'' method produce the proper list of neighbor nodes in an undirected graph?r r � � � � � N)r �build_simple_test_graphZ neighbors� assertEqual)r r �pairsr Zexpected_neighborsZactual_neighborsr r r �test_correct_neighborsg s � �z UDGTest.test_correct_neighborsc C sT t �� }g d�}|D ]:\}}}|�||�}| �||� |�||�}| �||� qdS )zXDoes the ''adjacent'' function correctly identify neighbor nodes in an undirected graph?))r r T)r r T)r r T)r r F)r r F)r r FN)r r Zadjacentr! )r r r" r r �expected�actualr r r �test_adjacency} s zUDGTest.test_adjacencyc C s: t �� }g d�}|D ] \}}|�||�}| �d|� qdS )zsDoes the ''edge_cost'' function return the appropriate cost for an edge that exists in an undirected graph?))r r )r r )r r )r r r N)r r � edge_costr! )r r Znodes_with_edgesr r �costr r r �test_existent_edge_cost� s z UDGTest.test_existent_edge_costc C s> t �� }g d�}|D ]$\}}|�||�}| �td�|� qdS )z^Does the ''edge_cost'' function return infinity for a nonexistent edge in an undirected graph?))r r )r r )r r )r r )r r )r r )r r )r r )r r )r r )r r )r r )r r )r r )r r )r r )r r �infN)r r r' r! �float)r r Znodes_without_edgesr r r( r r r �test_nonexistent_edge_cost� s z"UDGTest.test_nonexistent_edge_costN) �__name__� __module__� __qualname__r r r r r r# r& r) r, r r r r r s + r ) �__doc__ZunittestZpygraphr r r � r ZTestCaser r r r r �<module> s
| ver. 1.1 | |
.
| PHP 8.3.30 | Ð“ÐµÐ½ÐµÑ€Ð°Ñ†Ð¸Ñ Ñтраницы: 0 |
proxy
|
phpinfo
|
ÐаÑтройка