哈密顿路径在图G中找出一条包含所有顶点的简单路径，该路径称为哈密顿路径（1）图G是非完全有向图，且图G不一定存在哈密顿路径； ＞ （2）设计算法判断图G是否存在哈密顿路径，如果存在，输出一天哈密顿路径

/**
 *作者：魏宝航
 *2020年11月22日,下午21:47
 */
import java.io.IOException;
import java.util.Scanner;
public class MatrixUDG {
    private char[] mVexs;       
    private int[][] mMatrix;   
    private int num;
    private int edge;
    private boolean[] visit;
    private int[] road;
    private static int count=0;
    private int m=0;
    public MatrixUDG(char[] vexs, char[][] edges) {
        num = vexs.length;
        edge = edges.length;
        visit=new boolean[num+10];
        road=new int[num+10];
        mVexs = new char[num];
        for (int i = 0; i < mVexs.length; i++)
            mVexs[i] = vexs[i];
        mMatrix = new int[num][num];
        for(int i=0;i<edge;i++){
            for(int j=0;j<edge;j++){
                if(edges[i][j]=='∞'){
                    mMatrix[i][j]=Integer.MAX_VALUE;
                }
                else{
                    mMatrix[i][j]=1;
                }
            }
        }
    }
    public void print() {
        System.out.printf("Martix Graph:\n");
        for (int i = 0; i < mVexs.length; i++) {
            for (int j = 0; j < mVexs.length; j++){
                if(mMatrix[i][j]<Integer.MAX_VALUE){
                    System.out.printf("%d ", mMatrix[i][j]);
                }else{
                    System.out.print("∞ ");
                }
            }
            System.out.printf("\n");
        }
    }
    public void DFS(int v){
        visit[v]=true;
        road[count++]=v;
        for(m=0;m<num;m++){
            if(mMatrix[v][m]==1&&visit[m]==false){
                DFS(m);
            }
        }
        if(m==num){
            visit[v]=false;
            count--;
        }
    }
    public void Hamilton(){
        for(int i=0;i<num;i++){
            DFS(i);
        }
        System.out.print(road[0]+1);
        for(int i=1;i<num;i++){
            System.out.print("->"+(road[i]+1));
        }
    }
    public static void main(String[] args) {
        char[] vexs2={'1','2','3','4'};
        char[][] edges2=new char[][]{
                {'∞','1','1','∞'},
                {'∞','∞','∞','∞'},
                {'∞','1','∞','1'},
                {'∞','1','∞','∞'},
        };
        MatrixUDG g=new MatrixUDG(vexs2,edges2);
        g.print();
        g.Hamilton();
    }
}