Dijkstra算法是对称的吗？

import heapq

def dijkstra(graph, start):
    queue = []
    heapq.heappush(queue, (0, start))
    distances = {node: float('inf') for node in graph}
    distances[start] = 0
    shortest_path = {}

    while queue:
        (dist, current) = heapq.heappop(queue)

        if dist > distances[current]:
            continue

        for neighbor, weight in graph[current].items():
            distance = dist + weight

            if distance < distances[neighbor]:
                distances[neighbor] = distance
                heapq.heappush(queue, (distance, neighbor))
                shortest_path[neighbor] = current

    return distances, shortest_path

# 示例图
graph = {
    'A': {'B': 1, 'C': 4},
    'B': {'A': 1, 'C': 2, 'D': 5},
    'C': {'A': 4, 'B': 2, 'D': 1},
    'D': {'B': 5, 'C': 1}
}

distances, shortest_path = dijkstra(graph, 'A')
print("Distances:", distances)
print("Shortest Path:", shortest_path)