The computation of the shortest path in OSPF is usually done by ____________ A. bellman-ford algorithm B. routing information protocol C. dijkstra’s algorithm D. distance vector routing
The computation of the shortest path in OSPF is usually done by ____________ A. bellman-ford algorithm B. routing information protocol C. dijkstra’s algorithm D. distance vector routing
Share