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 ____________
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
The computation of the shortest path in OSPF is usually done by ____________
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!