-
Notifications
You must be signed in to change notification settings - Fork 49
/
ToposortDFS.cpp
87 lines (85 loc) · 3 KB
/
ToposortDFS.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
#include<bits/stdc++.h>
#include<iostream>
#include<ext/pb_ds/tree_policy.hpp>
typedef long long LL;
using namespace std;
using namespace __gnu_pbds;
typedef vector<int>vi;
typedef vector<long long>vl;
#define ll long long
#define MOD 1000000007
#define pb push_back
#define N 1e6+7
#define ordered_set tree<ll,ll,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define FOR(i,a,b) for (long i=a;i<b;i++)
#define trace(it,a) for (auto it=a.begin();it!=a.end();it++)
#define AUTO(it,a) for (auto it=a.begin();it!=a.end();it++)cout<<*it<<' ';cout<<endl;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define setbits(x) __builtin_popcount(x)
#define setbitsll(x) __builtin_popcountll(x)
#define maxv(v) *max_element(v.begin(), v.end())
#define minv(v) *min_element(v.begin(), v.end())
#define SORTD(V) sort(v.begin(), v.end(), greater<ll>())
#define SORT(V) sort(v.begin(), v.end())
#define lb(v,x) *lower_bound(v.begin(),v.end(),x)
#define ub(v,x) *upper_bound(v.begin(),v.end(),x)
#define lbi(v,x) lower_bound(v.begin(),v.end(),x)-v.begin()
#define ubi(v,x) upper_bound(v.begin(),v.end(),x)-v.begin()
#define all(a) a.begin(), a.end()
#define clr(s,val) memset(s, val, sizeof(s))
typedef vector<pair<long long, long long>> vii;
typedef pair<long long, long long> ii;
typedef pair<long long, pair<long long, long long>> iii;
typedef map<long long, long long> mii;
typedef map<char, long long> mci;
typedef set<long long> si;
typedef vector<vector<long long>> vvi;
long long binPow(long long a,long long b,long long modulo){long long prod = a;long long ans = 1;while(b){if(b%2) ans = (ans*prod)%modulo;b /= 2;prod = (prod*prod)%modulo;}return ans;}
ll modmul(ll a, ll b,ll mod){ll res = 0;a %= mod;while (b) {if (b & 1)res = (res + a) % mod;a = (2 * a) % mod;b >>= 1;}return res;}
ll gcdExtended(ll a, ll b, ll *x, ll *y);ll modInverse(ll b, ll m){ll x, y;ll g = gcdExtended(b, m, &x, &y);if (g != 1)return -1;return (x%m + m) % m;}ll moddivide(ll a, ll b, ll m){a = a % m;ll inv = modInverse(b, m);if (inv == -1)return -1;else return (inv * a) % m;}
ll gcdExtended(ll a, ll b, ll *x, ll *y){if (a == 0){*x = 0, *y = 1;return b;}ll x1, y1;ll gcd = gcdExtended(b%a, a, &x1, &y1);*x = y1 - (b/a) * x1;*y = x1;return gcd;}
bool compare(const pair<int, int>&i, const pair<int, int>&j)
{
return i.second < j.second;
}
int firstsetbit(ll n)
{
if(n==0) return 0;
return 32-__builtin_clz(n);
}
ll countPow2(ll n){
return __builtin_ctzll(n);
}
void topo(vl &vis,vl adj[],ll i,stack<ll> &s){
vis[i]=1;
for(auto it:adj[i]){
if(!vis[it]){
topo(vis,adj,it,s);
}
}
s.push(i);
}
int main()
{
fastio;
ll t;cin>>t;
while(t--){
ll n,m;cin>>n>>m;
vl adj[n+1];
vl vis(n+1,0);
FOR(i,0,m){
ll x,y;cin>>x>>y;
adj[x].pb(y);
}
stack<ll> s;
FOR(i,0,n+1){
if(!vis[i]){
topo(vis,adj,i,s);
}
}
while(!s.empty()){
cout<<s.top()<<" ";
s.pop();
}
}
}