Depth-First Search (DFS) is a graph traversal algorithm that explores as far as possible along each branch before backtracking. This visualization shows the entry and exit times for each node in a tree during DFS traversal.
When we visit a node, we mark its entry time. After exploring all its children, we mark its exit time. These times help us understand the structure of the traversal and are useful in various algorithms.