In a depth-first search (DFS) implementation for a graph, you find that the algorithm does not visit all nodes.What could be wrong? - Study24x7
Social learning Network
2 followers study24x7 29 Jul 2024 12:18 PM study24x7 study24x7

In a depth-first search (DFS) implementation for a graph, you find that the algorithm does not visit all nodes.
See more

A

The algorithm does not account for disconnected components

B

The starting node is chosen incorrectly

C

The visitation markers are not reset between runs

D

The recursion depth is limited

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