Routing Algorithms covered in CpE 471

Dijkstra's algorithms

Bellman-Ford routing algorithm is called Distance Vector Routing in section 5.2.5 of Tanenbaum.