## About

A simulator for the two classic families of routing protocols, built by a team of two. Routers running distance-vector routing (Bellman-Ford) learn routes only from their neighbours, while link-state routers flood link-state packets and run Dijkstra over the full map. Both recompute routes when links fail or change cost.

## What I worked on

• Implemented the distance-vector routing algorithm
• Implemented tie-breaking for link-state routing
• Set up the unit tests
• Wrote the scripts that run the simulator and build executables

## Built with

Python, Bellman-Ford, Dijkstra, Bash