Q. Which of the following is NOT a valid application of Dijkstra's algorithm?
-
A.
Finding the shortest path in a road network
-
B.
Finding the shortest path in a weighted graph
-
C.
Finding the minimum spanning tree
-
D.
Finding the shortest path in a communication network
Solution
Dijkstra's algorithm is not used for finding the minimum spanning tree; algorithms like Prim's or Kruskal's are used for that purpose.
Correct Answer:
C
— Finding the minimum spanning tree
Learn More →
Showing 1 to 1 of 1 (1 Pages)
