Файловый менеджер - Редактировать - /opt/imh-python/lib/python3.9/site-packages/pygraph/functions/searching/__pycache__/astar.cpython-39.pyc
Ðазад
a ^�h/ � @ s@ d Z ddlmZ ddlmZ dd� Zdd� Zdd � Zd d � Zd S ) z#Implements A* Search functionality.� )� PriorityQueue)�NonexistentNodeErrorc C s^ | � � }||vrt|��||vr(t|��t| ||�\}}}|rVt|||�}|�� |S g S dS )z�Runs an A* search on the specified graph to find a path from the ''start'' node to the ''goal'' node. Returns a list of nodes specifying a minimal path between the two nodes. If no path exists (disconnected components), returns an empty list. N)Zget_all_node_idsr �_a_star_search_internal�reconstruct_path�reverse)�graph�start�goalZ all_nodes� came_from� cost_so_far� goal_reached�path� r ��/root/rpmbuild/BUILDROOT/imh-python39-modules-3.9.7-92.el8.x86_64/opt/imh-python/lib/python3.9/site-packages/pygraph/functions/searching/astar.py� a_star_search s r c C s dS )N� r )�a�br r r � heuristic s r c C s� t � }|�|d� |di}|di}d}|�� s�|�� }||krDd}q�| �|�D ]V}|| | �||� } ||vsz| || k rN| ||< | t||� } |�|| � |||< qNq&|||fS )z�Performs an A* search, returning information about whether the goal node was reached and path cost information that can be used to reconstruct the path. � NFT)r �put�empty�getZ neighborsZ edge_costr ) r r r Zfrontierr r r �currentZ next_nodeZnew_cost�priorityr r r r s$ r c C s* |}|g}||kr&| | }|� |� q |S )N)�append)r r r r r r r r r ; s r N) �__doc__Zhelpersr � exceptionsr r r r r r r r r �<module> s
| ver. 1.1 | |
.
| PHP 8.3.30 | Ð“ÐµÐ½ÐµÑ€Ð°Ñ†Ð¸Ñ Ñтраницы: 0 |
proxy
|
phpinfo
|
ÐаÑтройка