What distinguishes depth-first search (DFS) from breadth-first search (BFS) in graph traversal? - 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 21 Aug 2024 10:20 AM study24x7 study24x7

What distinguishes depth-first search (DFS) from breadth-first search (BFS) in graph traversal?

A

DFS uses a queue, while BFS uses a stack

B

DFS can find the shortest path; BFS cannot

C

BFS uses a queue, while DFS uses a stack

D

DFS is recursive, while BFS cannot be made recursive

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