Dijkstra’s Algorithm is used to solve _____________ problems.
A. All pair shortest path
B. Single source shortest path
C. Network flow
D. Sorting
Answer:B
Dijkstra’s Algorithm is used to solve _____________ problems.
A. All pair shortest path B. Single source shortest path C. Network flow D. Sorting
Explanation: Dijkstra’s Algorithm is used for solving single source shortest path problems. In this algorithm, a single node is fixed as a source node and shortest paths from this node to all other nodes in graph is found.