An explicit stack avoids recursive call depth

For graph traversal, an iterative DFS stores pending vertices in a stack instead of relying on function calls. Mark vertices when pushing them, not only when popping, to avoid placing the same vertex on the stack many times. With adjacency lists the traversal remains O(V + E); iterative code also makes the stack storage explicit.