Cod sursa(job #539488)

Utilizator alex@ndraAlexandra alex@ndra Data 22 februarie 2011 23:04:28
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.9 kb
#include<fstream>
#include<vector>

using namespace std;
#define Nmax 50001
vector<int> G[Nmax];

long sortat[Nmax], viz[Nmax], nr, n, m;

void citire()
{int i, x, y;
     ifstream f("sortaret.in");
       f>>n>>m;
       
       nr=n+1;
       
     for(i=1;i<=m;i++)
     {
       f>>x>>y;
       G[x].push_back(y);
     }
     
     f.close();
}


void df(int nod)
{
     int i, vecini;
     
     viz[nod]=1;
     vecini=G[nod].size();
    
     
     for(i=0;i<vecini;i++)
       if(!viz[G[nod][i]])
          df(G[nod][i]);
          
      sortat[nr--]=nod;
}
 
 void afisare()
 {
      int i;
      ofstream g("sortaret.out");
      for(i=1;i<=n;i++)
        g<<sortat[i]<<" ";
      g.close();
 } 
 
int main()
{
    int i;
    citire();
    
    for(i=1;i<=n;i++)
       if(!viz[i])
          df(i);
          
    afisare();
    
    return 0;
}