jrichardson1225 jrichardson1225 22-05-2023 Computers and Technology contestada The visit all vertices in a graph, Depth First Search (DFS) needs to be called multiple times when: O The graph is acyclic. O The graph is a tree. O The graph is not connected. O The graph has cycles.
