
This project will illustrate an important network routing strategy called Link State routing. In this assignment, nodes will take an initial connectivity map of nodes. They will then implement and run Dijkstra's shortest path algorithm to build their routing tables. Finally, nodes will forward packets using their routing table.