Python implementation of the Bellman-Ford Distance Vector routing algorithm. Simulates router convergence across a configurable network topology, processing real-time link updates and computing optimal routing tables.
Simulating a network of routers performing route advertisement using a Distance Vector routing protocol Upon Convergence The program will need to read input from the terminal/command line's standard input. The input should be exactly as shown below (The program is case sensitive): X Y Z .... DISTANCEVECTOR .... X Z 8 X Y 2 Y Z 3 ..... UPDATE ... Y Z -1 X Z 3 END ...
Please read the attached PDF to gain more insights on the requirements of the program