Q22
In a weighted graph, which algorithm is suitable for finding the shortest path from a single source to a specific target node?
A.
Dijkstra's Algorithm
AnswerB.
Breadth-First Search (BFS)
C.
Bellman-Ford Algorithm
D.
Depth-First Search (DFS)
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board