Ответы на вопрос:
Def dijkstra(graph, node): """ simulate the dijkstra algorithm in a graph """ distance_to = {} distance_to[node] = 0 distance_path = {} while (distance_to): # in case we have a disjoint graph op_node = min_distance(distance_to) distance_path[op_node] = distance_to[op_node] del distance_to[op_node] for x, x_len in graph[op_node].items(): if x not in distance_path: if x not in distance_to: distance_to[x] = distance_path[op_node] + x_len elif distance_to[x] > distance_path[op_node] + x_len: distance_to[x] = distance_path[op_node] + x_len return distance_path
Популярно: Информатика
-
данданн01.03.2020 15:37
-
MilkaKamilka526.08.2022 20:04
-
azamaaaaa12.06.2020 02:37
-
LysaPysa05.03.2020 21:26
-
Masha827121.04.2022 05:26
-
янбаян03.09.2020 03:40
-
yarabar08.06.2023 19:17
-
suminjenya13.09.2021 18:57
-
lizochkanaumov127.10.2021 09:08
-
Даня1919114.12.2022 19:27