Q. The computation of the shortest path in OSPF is usually done by (Solved)
1. bellman-ford algorithm
2. routing information protocol
3. dijkstra’s algorithm
4. distance vector routing
- c. dijkstra’s algorithm
1. bellman-ford algorithm
2. routing information protocol
3. dijkstra’s algorithm
4. distance vector routing