Cod sursa(job #3259454)
| Utilizator | Data | 26 noiembrie 2024 12:48:24 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
#include <vector>
#include <stack>
using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
vector<int> g[50002];
stack<int> st;
int n,m,viz[50002];
void dfs(int nod){
viz[nod]=1;
for(auto it : g[nod])
if(!viz[it])
dfs(it);
st.push(nod);
}
int main()
{
cin>>n>>m;
int x,y;
for(int i=1;i<=m;i++){
cin>>x>>y;
g[x].push_back(y);
}
for(int i=1;i<=n;i++){
if(!viz[i])
dfs(i);
}
for(;!st.empty();st.pop())
cout<<st.top()<<' ';
return 0;
}
