You are right.If I understood the problem statement correctly, a calling circle is a strongly connected component of the call graph.
Both my Warshall and Tarjan implementations got AC when changing it to int. 
Code: Select all
code removed..
Code: Select all
#include <iostream>
#include <cstring>
#include <string>
#include <vector>
#include <map>
#define N 101
using namespace std;
int G[N][N];
int S[N], LOW[N], R[N], L[N];
int n, m, nVertex, nComponents;
map<string,int> person;
vector<string> name(N);
void Tarjan();
void DFS(int v);
int min(int a, int b);
int main()
{
int i, j, k;
int a, b, count = 0;
string str1, str2;
//freopen("out.txt", "w", stdout);
while(cin >> n >> m)
{
if(n == 0 && m == 0)
break;
if(count++ > 0)
cout << endl;
person.clear();
memset(G,0,sizeof(G));
memset(R,0,sizeof(R));
memset(S,-1,sizeof(S));
for(i=0; i<m; i++)
{
cin >> str1 >> str2;
if(person.find(str1) == person.end())
{
name[person.size()] = str1;
person[str1] = person.size();
}
if(person.find(str2) == person.end())
{
name[person.size()] = str2;
person[str2] = person.size();
}
a = person[str1];
b = person[str2];
G[a][b] = 1;
}
cout << "Calling circles for data set " << count << ":" << endl;
Tarjan();
}
return 0;
}
void Tarjan()
{
int i;
for(i=0; i<n; i++)
{
if(S[i] == -1)
{
nVertex = 0;
nComponents = 0;
DFS(i);
}
}
}
void DFS(int v)
{
int k, c;
S[v] = nVertex++;
L[nComponents++] = v; //Add to the stack
LOW[v] = S[v];
R[v] = 1; //v is in the stack
for(int i=0; i<n; i++)
{
if(G[v][i] == 1) //If there is a conexion v -> i
{
if(S[i] == -1) //if it's a tree node (unvisited)
{
DFS(i);
LOW[v] = min(LOW[v],LOW[i]);
}
else if(R[i] == 1) //if i is on the stack
LOW[v] = min(LOW[v],S[i]);
}
}
if(S[v] == LOW[v])
{
c = 0;
do
{
k = L[nComponents-1]; //Quit k from the stack
R[k] = 0; //k is no more on the stack
nComponents--;
if(c++ == 0)
cout << name[k];
else
cout << ", " << name[k];
}
while(k != v && nComponents > 0);
cout << endl;
}
}
int min(int a, int b)
{
if(a < b)
return a;
else
return b;
}Code: Select all
Removed after ACCode: Select all
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<string>
#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<deque>
#include<queue>
#include<map>
using namespace std;
typedef long long int L;
typedef unsigned long long int U;
vector<int>v[30];
vector<int>r[30];
map<string,int>m;
map<string,int>::iterator it;
map<int,int>f;
int visit[30];
int fval[30];
vector<string>nm;
stack<int>stk;
main()
{
int n,c;
for(int t = 1;;t++)
{
m.clear();
f.clear();
nm.clear();
cin>>n>>c;
if(!(n|c))
break;
int k = 0;
for(int i = 0;i<n;i++)
{
visit[i] = 0;
v[i].clear();
r[i].clear();
}
for(int i = 0;i<c;i++)
{
int a = -1, b = -1;
string str1,str2;
cin>>str1>>str2;
it = m.find(str1);
if(it == m.end())
{
nm.push_back(str1);
m.insert(make_pair(str1,k));
a = k++;
}
else
a = it->second;
it = m.find(str2);
if(it == m.end())
{
nm.push_back(str2);
m.insert(make_pair(str2,k));
b = k++;
}
else
b = it->second;
v[a].push_back(b);
r[b].push_back(a);
}
k = 0;
for(int i = n-1;i>=0;i--)
{
if(!visit[i])
{
int x;
visit[i] = 1;
stk.push(i);
while(!stk.empty())
{
x = stk.top();
bool child = 0;
for(int j = 0;j<r[x].size();j++)
{
if(!visit[r[x][j]])
{
child = 1;
visit[r[x][j]] = 1;
stk.push(r[x][j]);
}
}
if(!child)
{
x = stk.top();
stk.pop();
fval[x] = k;
f.insert(make_pair(k++,x));
}
}
}
}
for(int i = 0;i<n;i++)
visit[i] = 0;
if(t != 1)
cout<<endl;
printf("Calling circles for data set %d:\n", t);
for(int i = n-1;i>=0;i--)
{
bool first = 1;
int x = f.find(i)->second;
if(!visit[x])
{
visit[x] = 1;
stk.push(x);
while(!stk.empty())
{
x = stk.top();
stk.pop();
if(first)
{
cout<<nm[x];
first = 0;
}
else
cout<<", "<<nm[x];
for(int j = 0;j<v[x].size();j++)
{
if(!visit[v[x][j]])
{
visit[v[x][j]] = 1;
stk.push(v[x][j]);
}
}
}
if(!first)
cout<<endl;
}
}
}
}