📝 Question
#2338
In Unicast Routing, Dijkstra algorithm creates a shortest path tree from a ________
✓
Correct Answer
A. Graph
💡
Explanation
The Djikstra’s shortest path algorithm is the fastest among the algorithms for finding the shortest path in a graph. But it is a greedy method based algorithm so it does not guarantee the shortest path every time.
⌨️ Press
A
B
C
D
to select