-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathTopologicalSort.cpp
More file actions
135 lines (113 loc) · 2.65 KB
/
TopologicalSort.cpp
File metadata and controls
135 lines (113 loc) · 2.65 KB
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
// UVa OJ - 10305
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <queue>
#include <deque>
#include <stack>
#include <list>
#include <bitset>
#include <string>
#include <utility>
#include <iterator>
#include <fstream>
#include <sstream>
#include <numeric>
#include <functional>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <cctype>
#include <climits>
#include <ctime>
#include <cassert>
using namespace std;
/* typedef starts */
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
/* typedef ends */
/* macro starts */
#define PI acos(-1.0)
#define EPS 1e-9
#define fastIO ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define sinD(degree) sin((degree * PI) / 180.0)
#define cosD(degree) cos((degree * PI) / 180.0)
#define tanD(degree) tan((degree * PI) / 180.0)
#define cotD(degree) (1.0 / tanD(degree))
#define secD(degree) (1.0 / cosD(degree))
#define cosecD(degree) (1.0 / sinD(degree))
#define asinD(value) (asin(value) * 180.0) / PI
#define acosD(value) (acos(value) * 180.0) / PI
#define atanD(value) (atan(value) * 180.0) / PI
#define MAX_NODE 105
/* macro ends */
vector<int>adjList[MAX_NODE];
int inDegree[MAX_NODE];
vector<int>order;
bool done[MAX_NODE];
void initialize(int nodes);
void TopSort(int nodes);
int main()
{
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, m, i, u, v;
while (scanf("%d%d", &n, &m)) {
if (!n && !m) {
break;
}
initialize(n);
for (i = 1; i <= m; i++) {
scanf("%d%d", &u, &v);
adjList[u].push_back(v);
inDegree[v]++;
}
TopSort(n);
for (i = 0; i < order.size() - 1; i++) {
printf("%d ", order[i]);
}
printf("%d\n", order[i]);
}
return 0;
}
void initialize(int nodes)
{
order.clear();
for (int i = 1; i <= nodes; i++) {
adjList[i].clear();
inDegree[i] = 0;
done[i] = false;
}
}
void TopSort(int nodes)
{
int _count = 0;
int d, i, v;
while (_count != nodes) {
for (i = 1; i <= nodes; i++) {
if (inDegree[i] == 0 && !done[i]) {
d = i;
break;
}
}
for (i = 0; i < adjList[d].size(); i++) {
v = adjList[d][i];
inDegree[v]--;
}
order.push_back(d);
done[d] = true;
_count++;
}
}