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

Warning: include(./views/auth.php): failed to open stream: Permission denied in /var/www/html/live/loginRightSlider.php on line 18

Warning: include(): Failed opening './views/auth.php' for inclusion (include_path='.:/usr/share/php') in /var/www/html/live/loginRightSlider.php on line 18

Warning: count(): Parameter must be an array or an object that implements Countable in /var/www/html/live/makepost.php on line 52
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