Why might a breadth-first search (BFS) algorithm fail to find the shortest path in a weighted graph? - Study24x7
Social learning Network
2 followers study24x7 27 Aug 2024 10:28 AM study24x7 study24x7

Why might a breadth-first search (BFS) algorithm fail to find the shortest path in a weighted graph?

A

Because BFS does not account for edge weights

B

Because BFS only works on unweighted graphs

C

Because the graph is not properly connected

D

Because the starting node is chosen incorrectly

study24x7
Write a comment
Related Questions
500+   more Questions to answer
Most Related Articles