Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <queue>
- #include <iostream>
- #include <vector>
- #include <cstring>
- #include <iostream>
- #include <set>
- #include <cstring>
- #include <stack>
- //#include <bits/stdc++.h>
- using namespace std;
- typedef long long ll;
- const int maxn = 1e5 + 10;
- const ll INF = 3e16 + 10;
- vector<int> graph[maxn];
- bool visited[maxn];
- stack<int> st;
- void dfs(int node) {
- visited[node] = true;
- for(int i = 0; i < (int) graph[node].size(); i++) {
- int neighbour = graph[node][i];
- if(!visited[neighbour]) {
- dfs(neighbour);
- }
- }
- st.push(node);
- }
- int main() {
- ios_base::sync_with_stdio(false);
- int n, m;
- cin >> n >> m;
- for(int j = 0; j < m; j++) {
- int a, b;
- cin >> a >> b;
- a--; b--;
- graph[a].push_back(b);
- }
- for(int i = 0; i < n; i++) {
- if(!visited[i]) {
- dfs(i);
- }
- }
- while(!st.empty()) {
- cout << st.top() + 1 << " ";
- st.pop();
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement