如何在运行Dijkstra算法后获取并保存"for“循环结果为列表？

def dijkstra(graph, start):
    # 初始化距离字典和前驱节点字典
    distances = {node: float('inf') for node in graph}
    distances[start] = 0
    predecessors = {node: None for node in graph}

    # 创建一个空列表用于保存遍历的节点
    visited = []

    while graph:
        # 选择当前距离最小的节点
        current_node = min(distances, key=distances.get)

        # 更新当前节点的邻居节点的距离
        for neighbor in graph[current_node]:
            new_distance = distances[current_node] + graph[current_node][neighbor]
            if new_distance < distances[neighbor]:
                distances[neighbor] = new_distance
                predecessors[neighbor] = current_node

        # 将当前节点标记为已访问，并从图中移除
        visited.append(current_node)
        del distances[current_node]
        del graph[current_node]

    # 将遍历的节点列表作为结果返回
    return visited

# 示例图的邻接表表示
graph = {
    'A': {'B': 5, 'C': 3},
    'B': {'A': 5, 'C': 1, 'D': 3},
    'C': {'A': 3, 'B': 1, 'D': 2},
    'D': {'B': 3, 'C': 2}
}

start_node = 'A'
result = dijkstra(graph, start_node)
print(result)