1function dijkstra(graph, start):
2 dist[start] = 0, dist[others] = infinity
3 while unvisited nodes remain:
4 u = unvisited node with minimum dist[u]
5 for neighbor v of u:
6 if dist[u] + weight(u, v) < dist[v]:
7 dist[v] = dist[u] + weight(u, v)
No pseudocode line selected.