Link State
and Distance Vector
Routing Protocol implementation in Java
-
Link State Routing Protocol
Implemented using Dijkstra's Algorithm -
Distance Vector Routing Protocol
Implementd using Bellman-Ford Algorithm
Input:
<no. of vertices> <no. of edges = m>
<edge 1>
<edge 2>
..
..
Sample Input:
3 3
1 2 4
1 3 1
2 3 2