UVA 247(p365)----Calling Circles

#include<cstdio>
#include<iostream>
#include<vector>
#include<cstring>
using namespace std;
vector<string> name,ans;
string st1,st2;
bool g[100][100],v[100];
int n,m;
void floyd()
{
    for(int k=0; k<=n; k++)
        for(int i=0; i<=n; i++)
            for(int j=0; j<=n; j++)
                g[i][j]=g[i][j]||(g[i][k]&&g[k][j]);
}
int fd(const string&s)
{
    for(int i=0; i<name.size(); i++)
        if(name[i]==s) return i+1;
    name.push_back(s);
    return name.size();
}
void init()
{
    name.clear();
    ans.clear();
    memset(g,0,sizeof(g));
    memset(v,0,sizeof(v));
}
void dfs(int u)
{
    v[u]=true;
    for(int i=1; i<=n; i++)
        if(g[u][i]&&(!v[i])&&g[i][u])
        {
            cout<<", "<<name[i-1];
            dfs(i);
        }
}
int main()
{
    //freopen("out.out","w",stdout);
    int cas=0;
    while(scanf("%d%d",&n,&m)==2&&n)
    {
        cas++;
        init();
        if(cas!=1) puts("");
        printf("Calling circles for data set %d:\n",cas);
        for(int i=0; i<m; i++)
        {
            cin>>st1>>st2;
            int x=fd(st1),y=fd(st2);
            // cout<<x<<" "<<y<<endl;
            g[x][y]=true;
        }
        floyd();
        for(int i=1; i<=n; i++)
        {
            if(!v[i])
            {
                cout<<name[i-1];
                dfs(i);
                printf("\n");
            }
        }

    }
    return 0;
}

题目地址： https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=4&page=show_problem&problem=183