最短路径算法 - 迪杰斯特拉算法伪代码

最短路径算法 - 迪杰斯特拉算法（Dijkstra's Algorithm）：

function dijkstra(graph, start):
    distances = new Map()
    previous = new Map()
    unvisited = graph.getNodes()
    distances[start] = 0
    while unvisited is not empty:
        current = node with the smallest distance in distances
        unvisited.remove(current)
        for neighbor in graph.getNeighbors(current):
            distance = distances[current] + graph.getWeight(current, neighbor)
            if distance < distances[neighbor]:
                distances[neighbor] = distance
                previous[neighbor] = current
    return distances, previous