public void DFS(Graph G, int depth, int start, int end) {
        if ((depth == 0) && (start == end)) {
            path.push(start);
            System.out.println("" + path);
            return;
        }
        for (int i = 1; i <= numVertex; i++) {
            if ((adj[start-1][i-1]) && (!visited.contains(i))) {
                path.push(start);
                visited.push(start);
                DFS(G,depth-1,i,end);
                path.pop();
            }
        }
    }