Dijkstra’s Shortest Path
Two sets P (permanent) & T (temporary)
P: in current SP set, T: not yet in set
- P: initially current node, T: initially NULL
Every node in T must be reachable by a path from a node in P
Find every way to reach the T node from a P node; add min cost one to P, repeat