strongly-connected-components/kosaraju.cpp at master · thinkphp/strongly-connected-components · 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
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
#include <cstdio>
#include <vector>
#include <stack>
#include <cstring>
#define MAXN 100001
#define FIN "ctc.in"
#define FOUT "ctc.out"

using namespace std;

vector<int> Graph[ MAXN ];
vector<int> Graph_REVERSE[ MAXN ];
stack<int> Stack;
bool isVisited[ MAXN ];
vector<int> Results[ MAXN ];

int nodes,//number of nodes
    edges, //number of edges
    comp;//this holds the components strongly connex;

void readData() {

     int x,
         y;

     freopen(FIN, "r", stdin);

     scanf("%d %d", &nodes, &edges);

     for(int i = 1; i <= edges; i++) {

         scanf("%d %d", &x, &y);
         Graph[ x ].push_back( y );
         Graph_REVERSE[ y ].push_back( x );
     }

     fclose( stdin );
};

//for debug
void printGraph() {

     for(int i = 1; i <= nodes; i++) {

         printf("%d -> ", i);

         for(vector<int>::iterator it = Graph[ i ].begin(); it != Graph[ i ].end(); ++it) {

            printf("%d ", *it);
         }

         printf("\n");
     }
};

//for debug
void printReverseGraph() {

     for(int i = 1; i <= nodes; i++) {

         printf("%d -> ", i);

         for(vector<int>::iterator it = Graph_REVERSE[ i ].begin(); it != Graph_REVERSE[ i ].end(); ++it) {

            printf("%d ", *it);
         }

         printf("\n");
     }
};

void DFS(int node) {

     isVisited[ node ] = 1;

     for(vector<int>::iterator it = Graph[ node ].begin(); it != Graph[ node ].end(); ++it) {

         if(!isVisited[ *it ]) {

             DFS( *it );
         }
     }

     Stack.push( node );

};


void DFS_REVERSE(int node) {

     isVisited[ node ] = 1;

     Results[ comp ].push_back( node );

     for(vector<int>::iterator it = Graph_REVERSE[ node ].begin(); it != Graph_REVERSE[ node ].end(); ++it) {

         if(!isVisited[ *it ]) {

             DFS_REVERSE( *it );
         }
     }
};

//for debug
void printStack() {

 printf("\n");

 while(!Stack.empty()) {
       printf("%d ", Stack.top());
       Stack.pop();
 }
};

void Kosaraju() {

     int vertex = 0;

         for(int i = 1; i <= nodes; i++)

         if( !isVisited[ i ] ) {

             DFS( i );
         }

         memset(isVisited, 0, sizeof(isVisited));

         while( !Stack.empty() ){

                 vertex = Stack.top();

                 Stack.pop();

                 if(!isVisited[ vertex ]) {

                     comp++;

                     DFS_REVERSE( vertex );
                 }
         }
};

void writeData() {

     freopen(FOUT, "w", stdout);

     printf("%d\n", comp);

     for(int i = 1; i <= comp; i++) {

         //printf("%d -> ", i);

         for(vector<int>::iterator it = Results[ i ].begin(); it != Results[ i ].end(); ++it) {

            printf("%d ", *it);
         }

         printf("\n");
     }

     fclose( stdout );
};

int main() {

 readData();
 Kosaraju();
 writeData();

 return(0);
};