floyed

最新推荐文章于 2021-11-20 20:54:10 发布

罗旅洲

最新推荐文章于 2021-11-20 20:54:10 发布

阅读量502

点赞数 1

分类专栏：图论

本文链接：https://blog.csdn.net/Pig_cfbsl/article/details/52711930

版权

图论专栏收录该内容

12 篇文章 0 订阅

订阅专栏

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
using namespace std;
int d[103][103];
void prepare(int n){
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
			if(i==j)d[i][j]=0;
			else d[i][j]=100;
}
int main(){
	int i,j,k,m,n;
	int go,time;
	while(scanf("%d",&n)&&n){
		prepare(n);
		for(i=1;i<=n;i++){
		scanf("%d",&m);
		for(j=1;j<=m;j++){
			scanf("%d%d",&go,&time);
				d[i][go]=time;
		}
	}
		for(k=1;k<=n;k++)
			for(i=1;i<=n;i++)
				for(j=1;j<=n;j++)
					if(d[i][j]>d[i][k]+d[k][j])
						d[i][j]=d[i][k]+d[k][j];
		 int maxlength;
    	 int min_in_max=100;
	     int flag_source;
	     for(i=1;i<=n;i++){                     //ÒÔiµã×÷Îª¸÷Í¨Â·Ô´µã
	         maxlength=0;
	         for(j=1;j<=n;j++)
	             if(maxlength<d[i][j])   //Ñ°ÕÒiµ½jµÄ×î³¤Â·¾¶
	                maxlength=d[i][j];
	         if(min_in_max>maxlength){
	             min_in_max=maxlength;       //Ñ°ÕÒ×î³¤Â·¾¶ÖÐµÄ×î¶ÌÂ·
	             flag_source=i;              //¸Ã¶ÌÂ·ËùÔÚÂ·¾¶µÄÔ´µã¼ÇÂ¼
         }
     }
		 
	     if(min_in_max<100)
	         cout<<flag_source<<' '<<min_in_max<<endl;
	     else
	         cout<<"disjoint"<<endl;					
}
	return 0;
}