Файловый менеджер - Редактировать - /opt/imh-python/lib/python3.9/site-packages/pygraph/helpers/__pycache__/functions.cpython-39.pyc
Ðазад
a ^�h� � @ sh d Z ddlZddlmZmZ dd� Zdd� Zd d � Zd d � Zd d� Z dd� Z dd� Z dd� Z dd� Z dS )zuGathers together a collection of helper functions and classes that the library needs, but end users won't care about.� N� )�UndirectedGraph� DirectedGraphc sb t �| �}� fdd�|�� D �}|D ]}|�|� q$�fdd�|�� D �}|D ]}|�|� qN|S )zNConverts a subgraph given by a list of vertices and edges into a graph object.c s g | ]}|� vr|�qS � r ��.0�x)�edgesr ��/root/rpmbuild/BUILDROOT/imh-python39-modules-3.9.7-92.el8.x86_64/opt/imh-python/lib/python3.9/site-packages/pygraph/helpers/functions.py� <listcomp> � z!make_subgraph.<locals>.<listcomp>c s g | ]}|� vr|�qS r r r )�verticesr r r r )�copy�deepcopy�get_all_edge_ids�delete_edge_by_idZget_all_node_idsZ delete_node)�graphr r Z local_graphZedges_to_delete�eZnodes_to_delete�nr )r r r � make_subgraph s r c C sr t � }t�| j�|_t�| j�|_| j|_| j|_|�� D ]2}|�|�}|d d }|� |�}|d � |� q:|S )zWConverts a directed graph into an undirected graph. Directed edges are made undirected.r � r ) r r r �nodesr Z next_node_idZ next_edge_idr �get_edgeZget_node�append)�dg�udg�edge_id�edgeZtarget_node_idZ target_noder r r �$convert_graph_directed_to_undirected s r c C sL i }t | �� �}|D ]2}| �|�}|d }||v r>| �|� q|||< qdS )z.Removes duplicate edges from a directed graph.r N��sortedr r r )r �lookupr r r Ztplr r r � remove_duplicate_edges_directed4 s r" c C sl i }t | �� �}|D ]R}| �|�}|d }|d |d f}||v sJ||v rV| �|� q|||< |||< qdS )z1Removes duplicate edges from an undirected graph.r r r Nr )r r! r r r Ztpl_aZtpl_br r r �!remove_duplicate_edges_undirectedE s r# c C sB t � }|D ].}| �|�}|d \}}|�|� |�|� q t|�S )z�Transforms a list of edges into a list of the nodes those edges connect. Returns a list of nodes, or an empty list if given an empty list. r )�setr �add�list)r � edge_listZnode_setr r �a�br r r �get_vertices_from_edge_listV s r* c C s t | |�}t| ||�}|S )z+Transforms a list of edges into a subgraph.)r* r )r r' Z node_listZsubgraphr r r �get_subgraph_from_edge_listd s r+ c C s| i }i }|� � D ] }|d }| �� }|||< q|�� D ]<}|d }|d \} } || } || } | �| | �} | ||< q6||fS )z�Merges an ''addition_graph'' into the ''main_graph''. Returns a tuple of dictionaries, mapping old node ids and edge ids to new ids. �idr )Zget_all_node_objects�new_nodeZget_all_edge_objects�new_edge)Z main_graphZaddition_graphZ node_mappingZ edge_mapping�node�node_idZnew_idr r Zold_vertex_a_idZold_vertex_b_idZnew_vertex_a_idZnew_vertex_b_idZ new_edge_idr r r � merge_graphsl s r1 c C s� t | �rt� }nt� }g }t| �}t|�D ]}|�� }|�|� q*t|�D ]:}t|�D ],}| | | rV|| }|| } |�| |� qVqJ||fS )a� Generates a graph from an adjacency matrix specification. Returns a tuple containing the graph and a list-mapping of node ids to matrix column indices. The graph will be an UndirectedGraph if the provided adjacency matrix is symmetric. The graph will be a DirectedGraph if the provided adjacency matrix is not symmetric. Ref: http://mathworld.wolfram.com/AdjacencyMatrix.html)� is_adjacency_matrix_symmetricr r �len�ranger- r r. ) �adjacency_matrixr Znode_column_mapping� num_columns�_r0 �j�iZjnode_idZinode_idr r r �"create_graph_from_adjacency_matrix� s r: c C sz t | �}| D ]}t |�|kr dS q d}t|�D ]D}t|�D ].}||krJq<| | | | | | kr< dS q<|d7 }q0dS )zmDetermines if an adjacency matrix is symmetric. Ref: http://mathworld.wolfram.com/SymmetricMatrix.htmlFr r T)r3 r4 )r5 r6 �columnZmax_ir8 r9 r r r r2 � s r2 )�__doc__r �classesr r r r r" r# r* r+ r1 r: r2 r r r r �<module> s
| ver. 1.1 | |
.
| PHP 8.3.30 | Ð“ÐµÐ½ÐµÑ€Ð°Ñ†Ð¸Ñ Ñтраницы: 0 |
proxy
|
phpinfo
|
ÐаÑтройка