uva 247

floy 找圈 

 

#include <iostream>
#include <vector>
#include <map>
#include <cstring>
using namespace std;
 const int N=300;
 int a[N][N],vis[N],n,m;
 int tot;
 map<string,int> id;
 map<int,string> mp;
 int cas=0;
 
 void solve(){
 	int i,j,k,x,y;
 	string s1,s2;
 	tot=0;
 	for(i=1;i<=m;i++){
 		cin>>s1>>s2;
 		if(!id.count(s1)) id[s1]=++tot,mp[tot]=s1;
 		if(!id.count(s2)) id[s2]=++tot,mp[tot]=s2;
 		a[id[s1]][id[s2]]=1;
	 }
	for(k=1;k<=n;k++)
	 for(i=1;i<=n;i++)
	  for(j=1;j<=n;j++)
	   a[i][j]|=(a[i][k]&&a[k][j]);
	printf("Calling circles for data set %d:\n",++cas);
	
 	for(i=1;i<=n;i++){
 		if(vis[i]) continue;
 		vis[i]=1;
 		vector<int> v;
 		v.push_back(i);
 		for(j=i+1;j<=n;j++){
 			if(a[i][j]&&a[j][i]){
 				vis[j]=1; v.push_back(j);
			 }
		 }
		for(i=0;i<v.size();i++) cout<<mp[v[i]]<<' ';
		cout<<'\n';
	 }
 }
 signed main(){
 	
 	while(cin>>n>>m,n){
 		memset(vis,0,sizeof vis);
 		memset(a,0,sizeof a);
 		id.clear(); mp.clear();
 		solve();
	 }
 }