Cod sursa(job #1402215)

Utilizator ThomasFMI Suditu Thomas Thomas Data 26 martie 2015 13:32:54
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.62 kb
#include <fstream>
#include <vector>
using namespace std;

#define NMax 50005

ifstream f("sortaret.in");
ofstream g("sortaret.out");

int n,m;
vector<int> v[NMax];
int postord[NMax],nr;
bool viz[NMax];

void DFS(int x)
{
    viz[x]=true;
    for(int i=0;i<v[x].size();i++) if(!viz[v[x][i]]) DFS(v[x][i]);
    postord[++nr]=x;
}

int main()
{
    int i,a,b;

    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>a>>b;
        v[a].push_back(b);
    }

    for(i=1;i<=n;i++) if(!viz[i]) DFS(i);

    for(i=n;i>=1;i--) g<<postord[i]<<" "; g<<"\n";

    f.close();
    g.close();
    return 0;
}