资 源 简 介
package Extend_Floyd;
import java.io.*;
import java.util.Scanner;
public class Extend_Floyd {
/**
* @param args
*/
static final int INF=666666666;//注意INF可能溢出，慎用！
static final int MAXN=100+10;
static int nnum,mnum,cnt,minn;
static int path[],fa[][],cur[][],dist[][];
static void init()
{
path = new int[MAXN+1];
fa = new int[MAXN+1][MAXN+1];
cur = new int[MAXN+1][MAXN+1];
dist = new int[MAXN+1][MAXN+1];
for(int i=1;i<=MAXN;i++)
for(int j=1;j<=MAXN;j++)
{
if(i==j) dist[i][j]=cur[i][j]=0;
else dist[i][j]=cur[i][j]=INF;
&n
