摘要： 最短路问题：floyd算法：注意：输出格式#include<stdio.h>#define MAXN 200int a, b, n, d[30][30], num;void init(){ num = 0; while(scanf("%d",&a) == 1) { for(int i = 1; i <= 20; i ++) for(int j = 1; j <= 20; j ++) if(i == j) d[i][j] = 0; else d[i][j] = MAXN; ... 阅读全文