目录
代码实现思路
这个算法实现的思路很暴力,只需要三重循环更新数据即可。
练习题目: Floyd求最短路
java题解
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static int size = 210;
public static int INF = Integer.MAX_VALUE / 100;
public static int n, m, k;
public static int[][] map = new int[size][size];
public static void Init() {
for (int i = 1; i <= n; i++) {
Arrays.fill(map[i], INF);
map[i][i] = 0;//自己到自己的距离为0
}
}
public static void floyd() {
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) {
map[i][j] = Math.min(map[i][j], map[i][k] + map[k][j]);
}
}
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
n = input.nextInt();
m = input.nextInt();
k = input.nextInt();
Init();//初始化
for (int i = 0; i < m; i++) {
int a = input.nextInt();
int b = input.nextInt();
int c = input.nextInt();
map[a][b] = Math.min(map[a][b], c);
}
floyd();//寻找最短路
for (int i = 0; i < k; i++) {
int a = input.nextInt();
int b = input.nextInt();
int t = map[a][b];
if (t > INF / 2)
System.out.println("impossible");
else
System.out.println(t);
}
}
}