Файловый менеджер - Редактировать - /opt/imh-python/lib/python3.9/site-packages/tests/__pycache__/test_planarity.cpython-39.pyc
Ðазад
a ^�hA � @ sV d Z ddlZddlmZmZmZmZmZmZm Z m Z ddl m Z G dd� dej �ZdS ) z\Provides unit tests to verify that the planarity testing algorithm is functioning correctly.� N� )�UndirectedGraph� is_planar�build_cycle_graph�build_k5_graph�build_k33_graph�build_groetzch_graph�build_franklin_graph�build_chvatal_graph� )�utility_functionsc @ s� e Zd Zdd� Zdd� Zdd� Zdd� Zd d � Zd d � Zd d� Z dd� Z dd� Z dd� Z dd� Z dd� Zdd� Zdd � Zd d � Zd d � Zd!d"� Zd#d$� Zd%d&� Zd'S )(� IsPlanarTestc C s" t � }d}t|�}| �||� dS )zBDoes the ''is_planar'' function classify an empty graph as planar?TN)r r � assertEqual��self�graph�expected� planarity� r ��/root/rpmbuild/BUILDROOT/imh-python39-modules-3.9.7-92.el8.x86_64/opt/imh-python/lib/python3.9/site-packages/tests/test_planarity.py�test_empty_graph_is_planar s z'IsPlanarTest.test_empty_graph_is_planarc C s$ t �� }d}t|�}| �||� dS )zGDoes the ''is_planar'' function classify a single-node graph as planar?TN)r Zbuild_single_node_graphr r r r r r � test_single_node_graph_is_planar s z-IsPlanarTest.test_single_node_graph_is_planarc C s$ t �� }d}t|�}| �||� dS )zBDoes the ''is_planar'' function classify a 2-node graph as planar?TN)r Zbuild_2_node_graphr r r r r r �test_2_node_graph_is_planar s z(IsPlanarTest.test_2_node_graph_is_planarc C s$ t �� }d}t|�}| �||� dS )zDDoes the ''is_planar'' function classify a triangle graph as planar?TN)r Zbuild_triangle_graphr r r r r r � test_triangle_graph_is_planar% s z*IsPlanarTest.test_triangle_graph_is_planarc C s$ t �� }d}t|�}| �||� dS )zSDoes the ''is_planar'' function correctly classify the simple test graph as planar?TN)r Zbuild_simple_test_graphr r r r r r �test_simple_planar_graph. s z%IsPlanarTest.test_simple_planar_graphc C s$ t �� }d}t|�}| �||� dS )z�Does the ''is_planar'' function correctly classify the disconnected graph composed of triangle graphs as planar? TN)r Z build_disconnected_test_graphr r r r r r �+test_disconnected_triangle_graphs_is_planar7 s z8IsPlanarTest.test_disconnected_triangle_graphs_is_planarc C s$ t d�}d}t|�}| �||� dS )zPDoes the ''is_planar'' function correctly classify a tiny cycle graph as planar?� TN�r r r r r r r � test_tiny_cycle_graph_is_planarB s z,IsPlanarTest.test_tiny_cycle_graph_is_planarc C s$ t d�}d}t|�}| �||� dS )zQDoes the ''is_planar'' function correctly classify a small cycle graph as planar?� TNr r r r r � test_small_cycle_graph_is_planarK s z-IsPlanarTest.test_small_cycle_graph_is_planarc C s$ t d�}d}t|�}| �||� dS )zQDoes the ''is_planar'' function correctly classify a large cycle graph as planar?�d TNr r r r r � test_large_cycle_graph_is_planarT s z-IsPlanarTest.test_large_cycle_graph_is_planarc C sb z$t d�}d}t|�}| �||� W n8 ty\ } z |jd dkrDn|�W Y d}~n d}~0 0 dS )zXDoes the ''is_planar'' function correctly classify a really large cycle graph as planar?i� Tr z maximum recursion depth exceededN)r r r � RuntimeError�args)r r r r �er r r �'test_really_large_cycle_graph_is_planar] s z4IsPlanarTest.test_really_large_cycle_graph_is_planarc C s" t � }d}t|�}| �||� dS )zNDoes the ''is_planar'' function correctly classify the K5 graph as non-planar?FN)r r r r r r r �test_k5_graph_not_planarn s z%IsPlanarTest.test_k5_graph_not_planarc C s" t � }d}t|�}| �||� dS )zPDoes the ''is_planar'' function correctly classify the K3,3 graph as non-planar?FN)r r r r r r r �test_k33_graph_not_planarw s z&IsPlanarTest.test_k33_graph_not_planarc C s$ t �� }d}t|�}| �||� dS �z\Does the ''is_planar'' function correctly classify a graph with a K5 subgraph as non-planar?FN)r Z,build_non_planar_test_graph_with_k5_subgraphr r r r r r �test_k5_subgraph_not_planar� s z(IsPlanarTest.test_k5_subgraph_not_planarc C s$ t �� }d}t|�}| �||� dS r) )r Z9build_non_planar_disconnected_test_graph_with_k5_subgraphr r r r r r �(test_disconnected_k5_subgraph_not_planar� s z5IsPlanarTest.test_disconnected_k5_subgraph_not_planarc C s$ t �� }d}t|�}| �||� dS )z^Does the ''is_planar'' function correctly classify a graph with a K3,3 subgraph as non-planar?FN)r Z-build_non_planar_test_graph_with_k33_subgraphr r r r r r � test_k33_subgraph_not_planar� s z)IsPlanarTest.test_k33_subgraph_not_planarc C s$ t �� }d}t|�}| �||� dS )zRDoes the ''is_planar'' function correctly classify Peterson's graph as non-planar?FN)r Zbuild_petersons_graphr r r r r r � test_petersons_graph_not_planar� s z,IsPlanarTest.test_petersons_graph_not_planarc C s" t � }d}t|�}| �||� dS )zTDoes the ''is_planar'' function correctly classify the Groetzch graph as non-planar?FN)r r r r r r r � test_groetzch_graph_not_planar� s z+IsPlanarTest.test_groetzch_graph_not_planarc C s" t � }d}t|�}| �||� dS )zTDoes the ''is_planar'' function correctly classify the Franklin graph as non-planar?FN)r r r r r r r � test_franklin_graph_not_planar� s z+IsPlanarTest.test_franklin_graph_not_planarc C s" t � }d}t|�}| �||� dS )zSDoes the ''is_planar'' function correctly classify the Chvatal graph as non-planar?FN)r r r r r r r � test_chvatal_graph_not_planar� s z*IsPlanarTest.test_chvatal_graph_not_planarN)�__name__� __module__� __qualname__r r r r r r r r r" r& r' r( r* r+ r, r- r. r/ r0 r r r r r s& r )�__doc__ZunittestZpygraphr r r r r r r r � r ZTestCaser r r r r �<module> s (
| ver. 1.1 | |
.
| PHP 8.3.30 | Ð“ÐµÐ½ÐµÑ€Ð°Ñ†Ð¸Ñ Ñтраницы: 0 |
proxy
|
phpinfo
|
ÐаÑтройка