The ____ algorithm is used to traverse all the vertices of a graph in depthward motion.
- A*
- Breadth-First Search (BFS)
- Depth-First Search (DFS)
- Dijkstra's
The Depth-First Search (DFS) algorithm is used to traverse all the vertices of a graph in a depthward motion. It explores as far as possible along each branch before backtracking.
Loading...
Related Quiz
- How does a metaclass differ from a class in Python?
- For loops in Python utilize the ______ method internally to iterate over items.
- If you wish to make a shallow copy of a list, you can use the _______ method.
- In Python, the ____ statement is used to interrupt loop iteration and jump to the next iteration of the loop.
- Which of the following syntaxes is used to define an empty dictionary in Python?