uva 247 电话圈 (Floyd求传递闭包）

 

 

利用好map,set等工具实现人与编号的双射，然后就是裸的Floyd。

 

#include <cstdio>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <string>
using namespace std;
int n, m;
map<string, int> mp;
map<int, string> mp2;
set<string> st;
bool vis[100];
int num;
int can[30][30];
string str1, str2;
int tim = 1;

void Floyd( )
{
	for(int k = 0; k < n; k++)
	for(int i = 0; i < n; i++)
	for(int j = 0; j < n; j++)
		can[i][j] = can[i][j] || (can[i][k] && can[k][j]);
	return ;
}

void print(int cur)
{
	for(int i = 0; i < n; i++)
	{
		if(can[cur][i] && can[i][cur] && !vis[i])
		{
			cout << ", " << mp2[i];
			vis[i] = 1;
			print( i );
		}
	}
}

int main()
{
	//freopen("ztest.txt","r",stdin);
	while(scanf("%d%d", &n, &m))
	{
		if(n == 0 && m == 0)
			break;
		num = 0;
		mp.clear();
		mp2.clear();
		st.clear();
		memset(vis, 0, sizeof(vis));
		scanf("%d", &m);
		memset(can, 0, sizeof(can));
		for(int i = 0; i < m; i++)
		{
			cin >> str1 >> str2;
			if( !st.count( str1 ) )
			{
				mp2[num] = str1;
				mp[str1] = num++;
				st.insert(str1);
			}
			if( !st.count( str2 ) )
			{
				mp2[num] = str2;
				mp[str2] = num++;
				st.insert(str2);
			}
			can[mp[str1]][mp[str2]] = 1;
		}
		Floyd( );
		if(tim != 1)
			printf("\n");
		printf("Calling circles for data set %d:\n",tim++);
		for(int i = 0; i < n; i++)
		{
			if(vis[i]) continue;
			cout << mp2[i];
			vis[i] = 1;
			print( i );
			printf("\n");
		}
	}
}