using python add lots of comments

Iterative DFS Implementation:

$$ Utilize a stack to manage the traversal process.

$$ Initialize the stack with the starting node.

$$ Implement the traversal loop: pop a node from the stack, mark it

as visited if not already, and push its unvisited neighbors onto the

stack.

$$ Continue until the stack is empty.