多段图最短路径问题

A multistage graph is a graph (1) G=(V,E)with V partitioned into K >= 2 disjoint subsets such that if (a,b) is in E,then a is in V_i , and b is in V_i+1 for some subsets in the partition; and (2) | V₁ | = | V_K | = 1.

多段图java解法：

package com.secondwork;
/**
 * 多段图解法
 * @author YR
 *
 */
public class Test5 {
    private static int  n = 16;
    private static int[][] arr= {
            {0,5,3,0,0,0,0,0,0,0,0,0,0,0,0,0},
            {5,0,0,1,3,6,0,0,0,0,0,0,0,0,0,0},
            {3,0,0,0,8,7,6,0,0,0,0,0,0,0,0,0},
            {0,1,0,0,0,0,0,6,8,0,0,0,0,0,0,0},
            {0,3,8,0,0,0,0,3,5,0,0,0,0,0,0,0},
            {0,6,7,0,0,0,0,0,3,3,0,0,0,0,0,0},
            {0,0,6,0,0,0,0,0,8,4,0,0,0,0,0,0},
            {0,0,0,6,3,0,0,0,0,0,2,2,0,0,0,0},
            {0,0,0,8,5,3,8,0,0,0,0,1,2,0,0,0},
            {0,0,0,0,0,3,4,0,0,0,0,3,3,0,0,0},
            {0,0,0,0,0,0,0,2,0,0,0,0,0,3,5,0},
            {0,0,0,0,0,0,0,2,1,3,0,0,0,5,2,0},
            {0,0,0,0,0,0,0,0,2,3,0,0,0,6,6,0},
            {0,0,0,0,0,0,0,0,0,0,3,5,6,0,0,4},
            {0,0,0,0,0,0,0,0,0,0,5,2,6,0,0,3},
            {0,0,0,0,0,0,0,0,0,0,0,0,0,4,3,0},
    };
    
    //使用向后递推算法求多段图的最短路径
    public static void shortPath(int arr[][]){
int i = 1;
int sum = 0;
int temp = 0;
int p [] = new int[n];
int len[] = new int[n];
while(i<n){
   int total = Integer.MAX_VALUE;
   for(int j =0;j<i;j++){
if(arr[j][i]!=0){
//判断是否存在到该节点的路径，如果有则根据路径长度更新
   if(total>(arr[j][i]+len[j])){
total = arr[j][i]+len[j];
temp = j;
   }
   len[i] = total;
   sum = total;
   p[i] = temp;
}
   }
   i++;
}
int path[] = new int[7];//此图段数为7段
path[0] = 0;
path[6] = 15;
for(int k = 5;k>=1;k--){
   path[k] = p[path[k+1]];
}
System.out.println("最短路径为：");
for(int m = 0;m<6;m++){
   System.out.print(path[m]+"->");
}
System.out.println(path[6]);
System.out.println("最小代价为："+sum);
    }
    public static void main(String[] args) {

shortPath(arr);

    }
}

结果：

最短路径为：
0->1->4->7->11->14->15
最小代价为：18