/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

0 vote214 views1 answer
D-tale colab
Python
0 vote245 views1 answer
Python how to delete from dictionary a nan key
Python
0 vote206 views1 answer
Randomly splits this DataFrame with the provided weights
Python
0 vote209 views1 answer
Python documentacion comentarios
Python
3 votes238 views5 answers
Euclid algorithm
Python
1 vote221 views2 answers
Django queryset unique values
Python
0 vote519 views1 answer
Python minecraft server python gui
Python
0 vote216 views1 answer
Create requirements file and load it in new envirnment.
Python
2 votes249 views1 answer
List pop method in python
Python
0 vote241 views1 answer
How to make a dashboard with data representation using python free dash
Python