Q34
Which algorithm is suitable for finding the shortest path in a graph with varying weights?
A.
Prim's Algorithm
B.
Depth-First Search (DFS)
C.
Dijkstra's Algorithm
AnswerD.
Kruskal's Algorithm
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board