dfs.java

void DFS(Graph graph, int s, boolean[] visited) {
        Stack<Integer> stack = new Stack<Integer>();
        visited[s] = true;
        stack.push(s);

        while (!stack.isEmpty()) {
            int S = stack.pop();
            System.out.println("Visited vertex: " + S);
            
            for (int n : graph.adj.get(S)) {
                if (!visited[n]) {
                        visited[n] = true;
                        stack.push(n);
                }
            }
        }
    }