/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

5 votes274 views2 answers
Forgot django admin password
Python
3 votes272 views1 answer
Jinja2 datetime format
Python
4 votes232 views3 answers
Module 'tensorflow._api.v2.train' has no attribute 'gradientdescentoptimizer'
Python
1 vote257 views1 answer
How to minimize command console python
Python
0 vote270 views1 answer
Async, await, python
Python
0 vote264 views1 answer
Python select from list by boolean list
Python
0 vote289 views1 answer
List Comprehension iteration
Python
69 votes281 views6 answers
Python dictionary append
Python
0 vote279 views1 answer
AttributeError: module 'tensorflow._api.v2.train' has no attribute 'AdamOptiimizer'
Python
1 vote259 views2 answers
Python line break inside string
Python