Dijkstra's algorithm

DijkstrasAlgorithm.py

def DijkstrasAlgorithm(graph, start_node = 0, INFINITY = 10**10):
    #Takes a weighted adjacency list as input of the graph
    n = len(graph)
    D = [INFINITY]*n
    D[start_node] = 0
    cloud = [False for i in range(n)]
    
    for i in range(n):
        _, v = min((D[i], i) for i in range(n) if cloud[i] == False)
        cloud[v] = True
        
        #Follow pseudo-code
        for b, w in graph[v]:
            if cloud[b] == False:
                t = D[v] + w
                if t < D[b]:
                    D[b] = t
        
        flag = True
        for i in range(n):
            if cloud[i] == False:
                if D[i] != INFINITY:
                    flag = False
                    break
        if flag:
            break
    return D