Файловый менеджер - Редактировать - /opt/imh-python/lib/python3.9/site-packages/tests/__pycache__/utility_functions.cpython-39.pyc
Ðазад
a ^�h� � @ s� d Z ddlmZmZmZmZmZmZmZ d#dd�Z d$dd�Z d%dd �Z d&d d �Z d'd d �Z d(dd�Zdd� Zdd� Zd)dd�Zd*dd�Zd+dd�Zdd� Zd d � Zd d � Zd d!� Zd"S ),z,Provides utility functions for unit testing.� )� DirectedGraph�UndirectedGraph�build_triangle_graph�build_k5_graph�build_k33_graph�build_5_cycle_graph� merge_graphsFc C s\ | r t � }nt� }td�D ] }|�� q|�dd� |�dd� |�dd� |�dd� |S )z<Builds a simple undirected graph that gets used for testing.� � r � � � �r r �range�new_node�new_edge��directed�graph�_� r ��/root/rpmbuild/BUILDROOT/imh-python39-modules-3.9.7-92.el8.x86_64/opt/imh-python/lib/python3.9/site-packages/tests/utility_functions.py�build_simple_test_graph s r c C s | r t � }nt� }|�� |S )z.Builds a graph with a single node for testing.)r r r �r r r r r �build_single_node_graph s r c C s2 | r t � }nt� }|�� |�� |�dd� |S )z,Builds a 2-node connected graph for testing.r r �r r r r r r r r �build_2_node_graph+ s r c C sF | r t � }nt� }|�� |�� |�� |�dd� |�dd� |S )z9Builds a 3-node, 2-edge connected line graph for testing.r r � r r r r r �build_3_node_line_graph9 s r c C sF | r t � }nt� }|�� |�� |�� |�dd� |�dd� |S )ziBuilds a 3-node, 2-edge connected line graph for testing, where the root node is the articulation vertex.r r r r r r r r �)build_3_node_line_root_articulation_graphJ s r c C s | r t � }nt� }td�D ] }|�� q|�dd� |�dd� |�dd� |�dd� |�dd� |�dd� |�dd� |�dd� |�d d � |�d d � |�d d � |�d d� |�d d � |�d d � |�d d� |�d d� |�dd� |�dd � |S ) zOBuilds a graph with multiple biconnected components that gets used for testing.� r r r r r r r � � � � r r r r r � build_biconnected_test_graph[ s0 r% c C s t � } | �dd� | S )zNBuilds a graph with only one biconnected component that gets used for testing.r r )r% r )r r r r �"build_fully_biconnected_test_graph� s r& c C s* t � } t � }t � }t| |� t| |� | S )zMBuilds a graph with three disconnected components that gets used for testing.)r r )r �g2Zg3r r r � build_disconnected_test_graph� s r( c C sX | r t � }nt� }|�� |�� |�� |�ddd� |�ddd� |�ddd� |S )z/Builds a triangle graph with costs for testing.r r r r# r r r r r � build_triangle_graph_with_costs� s r) c C sn | r t � }nt� }|�� |�� |�� |�� |�ddd� |�ddd� |�ddd� |�ddd� |S )z-Builds a square graph with costs for testing.r r r r# r r r r r r �"build_square_test_graph_with_costs� s r* c C s� | r t � }nt� }td�D ] }|�� q|�ddd� |�ddd� |�ddd� |�ddd� |�ddd� |�ddd� |�ddd� |�ddd� |�ddd � |�ddd� |�ddd� |�ddd� |S ) z<Builds a test graph that has a unique minimum spanning tree.r r r r r r r# r r! r r r r r �)build_complicated_test_graph_with_one_mst� s$ r+ c C s t � } t� }t| |� | S )zKBuilds a test graph that contains K5 as a subgraph, and is thus non-planar.�r r r �r �addition_graphr r r �,build_non_planar_test_graph_with_k5_subgraph� s r/ c C s t � } t� }t| |� | S )zMBuilds a test graph that contains K3,3 as a subgraph, and is thus non-planar.)r r r r- r r r �-build_non_planar_test_graph_with_k33_subgraph� s r0 c C s* t � } t� }t� }t| |� t| |� | S )zXBuilds a disconnected test graph that contains K5 as a subgraph, and is thus non-planar.r, )r r. Zaddition_graph2r r r �9build_non_planar_disconnected_test_graph_with_k5_subgraph� s r1 c C s� t � } td�D ] }| �� q| �dd� | �dd� | �dd� | �dd� | �dd� | �dd� | �dd� | �d d� | �d d� | �dd� | S ) z�Builds a non-planar test graph that does not contain K5 or K3,3 as a subgraph (Peterson's Graph). Ref: http://mathworld.wolfram.com/PetersenGraph.htmlr r r! r" r r# r r r r )r r r r )r r r r r �build_petersons_graph� s r2 N)F)F)F)F)F)F)F)F)F)�__doc__Zpygraphr r r r r r r r r r r r r% r& r( r) r* r+ r/ r0 r1 r2 r r r r �<module> s $ *
| ver. 1.1 | |
.
| PHP 8.3.30 | Ð“ÐµÐ½ÐµÑ€Ð°Ñ†Ð¸Ñ Ñтраницы: 0 |
proxy
|
phpinfo
|
ÐаÑтройка