import json graph = [[(1, 4), (2, 1)], [(3, 2)], [(1, 1), (3, 5)], [], []] distance = [0] + [float("inf")] * (len(graph) - 1) unvisited = list(range(len(graph))) while unvisited: # 距离最小者先定型。非负边保证已定型距离不会被后续路径改善。 node = min(unvisited, key=lambda index: distance[index]) if distance[node] == float("inf"): break unvisited.remove(node) for neighbor, weight in graph[node]: distance[neighbor] = min(distance[neighbor], distance[node] + weight) assert distance[:4] == [0, 2, 1, 4] and unvisited == [4] result = {"reachable_distances": distance[:4], "unreachable_count": len(unvisited)} print("LAB_RESULT " + json.dumps(result, ensure_ascii=False))