📝 Question
#2372
The computation of the shortest path in OSPF is usually done by ____________
✓
Correct Answer
C. Dijkstra’s algorithm
💡
Explanation
Shortest path in OSPF is usually computed by Dijkstra’s algorithm. It was proposed by Edsger W. Dijkstra in the year
⌨️ Press
A
B
C
D
to select