Dijkstra algorithm's - pseudo code
- For each node n in the graph - 0 n.distance = Infinity
- Create an empty list.
- start.distance = 0,add start to list.
- While list not empty
- Let current = node in the list with the smallest distance, remove current from list
- For each node, n that is adjacent to current
If n.distance > current.distance + length of edge from n to current
n.distance = current.distance + length of edge from n to current
n.parent = current
add n to list if isn't there already