Q17
Which algorithm is used for finding the shortest path in a graph with all edges having the same weight?
A.
Bellman-Ford Algorithm
B.
Breadth-First Search (BFS)
AnswerC.
Floyd-Warshall Algorithm
D.
Bellman-Ford Algorithm
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board