Iterative Depth First Search on Nodes

DFS_Iterative.java

public void DFS_Iterative(Node n) {

        Stack<Node> stack = new Stack<Node>();
        stack.push(n);
        
        while (!stack.isEmpty()) {
            Node node = stack.pop();
            if (!node.visited) {
                node.visited = true;
                System.out.println(node);
                Stack<Node> tempStack = new Stack<Node>();
                for (Node x: node.adjList) {
                    if (!x.visited) 
                        tempStack.push(x);
                }
                while (!tempStack.isEmpty())
                    stack.push(tempStack.pop());
            }
        }
        
    }