/Python/Def Dijsktra(graph,source): dist = [0]*5 dist[0] = source v = 1 unvisited = {place: None for place in graph.keys()} visited = {} current = source currentDistance = 0 unvisited[current] = currentDistance

Def Dijsktra(graph,source): dist = [0]*5 dist[0] = source v = 1 unvisited = {place: None for place in graph.keys()} visited = {} current = source currentDistance = 0 unvisited[current] = currentDistance

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 vote78 views1 answer
Python in
Python
2 votes106 views1 answer
Graph implementation in python
Python
4 votes118 views2 answers
Extract text from pdf python
Python
-1 vote108 views2 answers
Python main template
Python
58 votes65 views1 answer
Case in pyhton
Python
0 vote106 views1 answer
Check if value in dictionary keys python dataframe
Python
1 vote117 views1 answer
Django integer field example
Python
-2 votes108 views1 answer
Whole loop in python
Python
0 vote107 views1 answer
Revit dynamo select all categories
Python
18 votes107 views6 answers
Turtle python
Python