Q1
Which algorithm is used to find the shortest path from a source node to all other nodes in a graph with non-negative weights?
A.
Breadth-First Search (BFS)
B.
Depth-First Search (DFS)
C.
Bellman-Ford Algorithm
D.
Dijkstra's Algorithm
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board