Starting at A, neighbours taken in alphabetical order. Watch when each node is pushed (discovered) versus when it's popped (finished) — they are very different sequences.
The current node's entry is highlighted. DFS simply reads its neighbours left to right — green = already visited (skipped), white = unvisited (taken next).
Same information, matrix form: read the highlighted row left to right and take the first 1 whose column isn't green yet.
——Keyboard: ← → to step · Space to play/pause · R to reset