/Python/Python dijkstra implementation stack

Python dijkstra implementation stack

nodes = ('A', 'B', 'C', 'D', 'E', 'F', 'G')
distances = {
    'B': {'A': 5, 'D': 1, 'G': 2},
    'A': {'B': 5, 'D': 3, 'E': 12, 'F' :5},
    'D': {'B': 1, 'G': 1, 'E': 1, 'A': 3},
    'G': {'B': 2, 'D': 1, 'C': 2},
    'C': {'G': 2, 'E': 1, 'F': 16},
    'E': {'A': 12, 'D': 1, 'C': 1, 'F': 2},
    'F': {'A': 5, 'E': 2, 'C': 16}}

unvisited = {node: None for node in nodes} #using None as +inf
visited = {}
current = 'B'
currentDistance = 0
unvisited[current] = currentDistance

while True:
    for neighbour, distance in distances[current].items():
        if neighbour not in unvisited: continue
        newDistance = currentDistance + distance
        if unvisited[neighbour] is None or unvisited[neighbour] > newDistance:
            unvisited[neighbour] = newDistance
    visited[current] = currentDistance
    del unvisited[current]
    if not unvisited: break
    candidates = [node for node in unvisited.items() if node[1]]
    current, currentDistance = sorted(candidates, key = lambda x: x[1])[0]

print(visited)

Source: stackoverflow.com

Similar codes

1 vote205 views1 answer
Palindrome Check using for loop in python
Python
0 vote229 views1 answer
What will be the output of the following python code? i = 0 while i < 5: print(i) i += 1 if i == 3: break else: print(0)
Python
55 votes211 views5 answers
How to clear the console python
Python
9 votes207 views6 answers
Pattern in python
Python
11 votes216 views1 answer
Scikit learn svm
Python
0 vote208 views1 answer
Numpy move columns
Python
1 vote207 views1 answer
How to count post by category django
Python
0 vote198 views1 answer
Fix the size of a deque python
Python
5 votes192 views2 answers
Python string list to float
Python
0 vote224 views3 answers
Python isdigit
Python