poj1125 floyd

//数据是多次并发的
#include<iostream>
using namespace std;
int dist[110][110] = { 0 };
int N = 0, i = 0, n = 0, j = 0, a = 0, len = 0;
void floyd()
{
	int k = 0;
	for (k = 1; k <= N; k++)
	{
		for (i = 1; i <= N; i++)
		{
			for (j = 1; j <= N; j++)
			{
				if (i!=j&&dist[i][j] > dist[i][k] + dist[k][j])
					dist[i][j] = dist[i][k] + dist[k][j];
			}
		}
	}
	int max_length =0,min_length=0x3f3f3f3f,num=0;
	for (i = 1; i <= N; i++)
	{
		 max_length = 0;
		for (j = 1; j <= N; j++)
		{
			if (i != j&&max_length < dist[i][j])
				max_length = dist[i][j];
		}
		if (max_length < min_length)
		{
			min_length = max_length;
			num = i;
		}
	}
	if (min_length < 0x3f3f3f3f)
	{
		cout << num << " " << min_length << endl;
	}
	else
	{
		cout << "disjoint" << endl;
	}

}
int main()
{
	
	while (1)
	{
		memset(dist, 0x3f3f3f3f, sizeof(dist));
		cin >> N;
		if (N == 0) break;
		for (i = 1; i <= N; i++)
		{
			cin >> n;
			for (j = 1; j <= n; j++)
			{
				cin >> a >> len;
				dist[i][a] = len;
			}
		}
		floyd();
     }
	return 0;
}