Mai intai trebuie sa te autentifici.
Cod sursa(job #2969619)
Utilizator | Data | 23 ianuarie 2023 14:38:10 | |
---|---|---|---|
Problema | Sortare topologica | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.69 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
int n, m;
vector<vector<int>> graph;
vector<bool> visited;
vector<int> tsort;
void dfs(int s) {
tsort.push_back(s);
visited[s] = true;
for (auto neigh: graph[s])
if (!visited[neigh])
dfs(neigh);
}
int main() {
in >> n >> m;
graph.resize(n + 1);
visited.resize(n + 1);
for (int i = 0; i < m; i++) {
int x, y;
in >> x >> y;
graph[x].push_back(y);
}
for (int i = 1; i <= n; i++)
if(!visited[i])
dfs(i);
for(auto x:tsort)
out<<x<<" ";
in.close();
out.close();
return 0;
}