dfs-recursive.java

void DFSRecursive(Graph g, int s, boolean[] visited) {
        System.out.println("Visited vertex: " + s); 
        visited[s] = true;
        
        for (int n : g.adj.get(s)) {
                
            if (visited[n] == false) {
                    // visited[n] = true;   
                    DFSRecursive(g, n, visited);       
            }
      }
}