Python Dijkstra算法是什么

def dijstra(adj, src, dst, n):

    dist = [Inf] * n

    dist[src] = 0

    book = [0] * n # 记录已经确定的顶点

    # 每次找到起点到该点的最短途径

    u = src

    for _ in range(n-1):    # 找n-1次

        book[u] = 1 # 已经确定

        # 更新距离并记录最小距离的结点

        next_u, minVal = None, float('inf')

        for v in range(n):    # w

            w = adj[u][v]

            if w == Inf:    # 结点u和v之间没有边

                continue

            if not book[v] and dist[u] + w < dist[v]: # 判断结点是否已经确定了，

                dist[v] = dist[u] + w

                if dist[v] < minVal:

                    next_u, minVal = v, dist[v]

        # 开始下一轮遍历

        u = next_u

    print(dist)

return dist[dst]