-
Notifications
You must be signed in to change notification settings - Fork 1
/
Kahn'sAlgo.cpp
88 lines (82 loc) · 2.53 KB
/
Kahn'sAlgo.cpp
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
#include <bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
#define NFS(nitro) ios_base::sync_with_stdio(false);cin.tie(0);
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
#define int long long
#define vivek main
#define all(x) (x).begin(),(x).end()
#define vec_p vector<pair<int,int>
#define v vector<int>
vector<int> kahnAlgo(v adj[],int n){
queue<int> q;
v indegree(n,0);
// Counting indegree
for(int i=1;i<=n;i++){
for(auto x:adj[i]){
indegree[x]++;
}
}
// adding indegree 0 to queue
for(int i=1;i<=n;i++){
if(!indegree[i]) q.push(i);
}
v ans;
while(q.empty()){
int node = q.front();
q.pop();
ans.push_back(node);
for(auto x:adj[node]){
indegree[x]--;
if(!indegree[x]) q.push(x);
}
}
return ans;
}
void solve(){
int m,n;cin>>m>>n;
v adj[n+1];
for(int i=1;i<=m;i++){
int x,y;cin>>x>>y;
adj[x].push_back(y);
// adj[x]
}
debug(kahnAlgo(adj,n));
}
int32_t vivek(){
NFS(NITRO);
int t;
cin>>t;
while(t-->0)
solve();
return 0;
}
// ___. .__ __ .__ __
// \_ |__ | | _____ ____ | | _____ _|__|__ __ ____ | | __
// | __ \| | \__ \ _/ ___\| |/ /\ \/ / \ \/ // __ \| |/ /
// | \_\ \ |__/ __ \ \___| < \ /| |\ /\ ___/| <
// |___ /____(____ /\___ >__|_ \ \_/ |__| \_/ \___ >__|_ \
// \/ \/ \/ \/ \/ \/