Method DFSTraversal

Java/DFSTraversal.java:8–15

(int V)

    /* Creation of the graph */
    DFSTraversal(int V) /* 'V' is the number of vertices in the graph */
    {
        adj = new LinkedList[V];
        visited = new boolean[V];

        for (int i = 0; i < V; i++)
            adj[i] = new LinkedList<Integer>();
    }

    /* Adding an edge to the graph */
    void insertEdge(int src, int dest) {