Method DFS

Java/DFSTraversal.java:22–33

(int vertex)

    }

    void DFS(int vertex) {
        visited[vertex] = true; /* Mark the current node as visited */
        System.out.print(vertex + " ");

        // Iterator<Integer> it = adj[vertex].listIterator();
        ListIterator<Integer> ti = adj[vertex].listIterator();
        while (ti.hasNext()) {
            int n = ti.next();
            if (!visited[n])
                DFS(n);
        }
    }

    public static void main(String args[]) {
        Scanner sc = new Scanner(System.in);