Cod sursa(job #2261468)
| Utilizator | Data | 16 octombrie 2018 11:29:54 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector <int> mv[50005];
queue <int> q;
int viz[50005];
int n,m;
void BFS(int x){
int i;
q.push(x);
viz[x]=1;
fout<<x<<" ";
while(!q.empty()){
x=q.front();
q.pop();
for(i=0;i<mv[x].size();i++)
if(!viz[mv[x][i]])
BFS(mv[x][i]);
}
}
int main(){
int i,x,y;
fin>>n>>m;
for(i=1;i<=m;i++){
fin>>x>>y;
mv[x].push_back(y);
}
for(i=1;i<=n;i++)
if(!viz[i])
BFS(i);
return 0;
}
