Cod sursa(job #1582270)

Utilizator gorni97aaa aaa gorni97 Data 27 ianuarie 2016 19:43:02
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.64 kb
#include <iostream>
#include <fstream>
#define maxn 50500
using namespace std;
int n,m,a[maxn][maxn];
void citire()
{fstream f("sortaret.in",ios::in);
f>>n>>m;int x,y,i,j;
for(i=1;i<=n;i++)
    for(j=1;j<=n;j++)
    a[i][j]=0;

for(int i=1;i<=m;i++)
    {f>>x>>y;
    a[x][y]=1;}

}

void adancime(int S)
{fstream g("sortaret.out",ios::out);
    int x[maxn],vizitat[maxn],k,i;
for(i=1;i<=n;i++)
    vizitat[i]=0;
x[1]=S;
k=1;
while(k>0)
{S=x[k];k--;
g<<S<<" ";
vizitat[S]=2;
for(i=1;i<=n;i++)
    if((vizitat[i]==0)&&(a[S][i]==1))
{k++;
x[k]=i;
vizitat[i]=1;
}
}}

int main()



{citire();
adancime(1);


}