public void DFS(int v) {
        boolean[] visited = new boolean[vertice];
        for (int i = 0; i < visited.length; i++) {
            visited[i] = false;
        }
        for (int i = 0; i < vertice; i++) {
            if (!visited[i])
            DFSUtils(i, visited);
        }
        
    }