/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

3 votes292 views1 answer
Best games made in pygame
Python
1 vote337 views1 answer
Django queryset average of unique values
Python Django
3 votes300 views2 answers
Draw bounding box on image python opencv
Python
0 vote323 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
0 vote291 views1 answer
Tuple count in python
Python
0 vote318 views3 answers
Converter python to c++ code
Python
0 vote298 views1 answer
How to make gtts text to speech converter
Python
0 vote311 views1 answer
Replace word in column pandas lambda
Python
0 vote314 views1 answer
Python string ignore characters
Python
0 vote285 views1 answer
Xlabel not showing matplotlib
Python