Algorithms/SCC.cpp at master · asimali246/Algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <set>
#include <cstring>
#include <iomanip>
#include <map>
#include <algorithm>
#include <stack>
#include <queue>
#include <list>
#include <string>
#include <vector>
#include <new>
#include <bitset>
#include <ctime>

 using namespace std;

#define ll long long int
#define INF 2147483647
#define PI acos(-1.0)
#define EPS 1e-9

template <typename X> X gcd(X a, X b){if(!b)return a; else return gcd(b, a%b);}

typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<ll, ll> llp;
typedef pair<double, double> dd;
typedef pair<char, int> ci;

vector<vector<ii> > adj;
vi low, num, visited, S;
int t, n, m, ans, x, y, i, counter, cs=1;
map<string, int> mp;
map<int, string> rev;
char a[33], b[33];
bool blank=false, space=false;

void Tarjan(int u)
{
	low[u]=num[u]=counter++;
	S.push_back(u);
	visited[u]=1;
	for(int j=0;j<(int)adj[u].size();++j)
	{
		ii v=adj[u][j];
		if(num[v.first]==-1)
			Tarjan(v.first);
		if(visited[v.first])
			low[u]=min(low[u], low[v.first]);
	}
	if(low[u]==num[u])
	{
		while(1)
		{
			int v=S.back();
			S.pop_back();
			visited[v]=0;
			if(space)
				printf(", ");
			space=true;
			cout<<rev[v];
			if(u==v)
				break;
		}
		printf("\n");
		space=false;
	}
}
int main()
{
	adj.assign(33, vector<ii>());
	visited.assign(33, 0);
	low.assign(33, 0);
	low.assign(33, 0);
	num.assign(33, 0);
	while(true)
	{
		counter=1;
		scanf("%d %d", &n, &m);
		if(!n && !m)
			break;
		for(i=1;i<=n;++i)
			adj[i].clear(), num[i]=-1, low[i]=visited[i]=0;
		mp.clear();
		rev.clear();
		while(m--)
		{
			scanf("%s %s", a, b);
			if(mp.count(a)==0)
			{
				mp[a]=counter++;
				rev[counter-1]=a;
			}
			if(mp.count(b)==0)
			{
				mp[b]=counter++;
				rev[counter-1]=b;
			}
			adj[mp[a]].push_back(make_pair(mp[b], 1));
		}
		if(blank)
			putchar('\n');
		blank=true;
		counter=0;
		S.clear();
		printf("Calling circles for data set %d:\n", cs++);
		for(i=1;i<=n;++i)
			if(num[i]==-1)
				{
					space=false;
					Tarjan(i);
				}
	}
	return 0;
}