Shortest Path
Algorithm performs O((E +N) logN) [E: link, N: router]; if E remains relatively constant with increased N, just O(NlogN)
At completion of algorithm, each router knows the router on the shortest path to reach it
Can use technique like source-tracing to compute next hops for every destination