java使用弗洛伊德(floyd)算法获取最短路，并打印对应路径

java使用弗洛伊德(floyd)算法获取最短路径，并打印对应路径

作业是使用动态规划获取最短路径，自然想到了牛逼的floyd算法
有向图：

public class Main{
   
    public static void main(String[] args){
   
        //创建顶点名称，获取方便后面打印路径
        String[] vax={
   "A","B1","B2","B3","C1","C2","C3","D1","D2","E"};
        int len=vax.length;
        int[][] path=new int[len][len];
        int[][] graph=creat_Graph(len,path);
        //使用动态规划获取最短路径
        floyd(graph,len,vax,path);
        //打印线路（u，v）路径，0和9对应<A,E>路线
        print_road(graph,path,vax,0,9);
    }
    public static void print_road(int[][] graph,int[][]path