Try this exercise. Is this statement true or false?
Depth-first search (DFS) is a graph traversal algorithm that visits all of the direct neighbors of a node before visiting any of its descendants.
Press true if you believe the statement is correct, or false otherwise.
