Cod sursa(job #544776)

Utilizator tudorDudeTudor Vioreanu tudorDude Data 2 martie 2011 09:10:39
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.7 kb
# include <iostream>
# include <fstream>
using namespace std;
fstream f("bfs.in",ios::in);
fstream g("bfs.out",ios::out);
int a[100][100],x,y,s,c[100],n,m,i,p,pas[100],viz[100],u;
int main()
{
    f>>n>>m>>s;
    for (i=1;i<=m;i++)
    {
        f>>x>>y;
        a[x][y]=1;
    }
p=u=1;
c[p]=s;
viz[s]=1;
;pas[s]=0;
while (p<=n)
{
    x=c[p];
    for (i=1;i<=n;i++)
            if (a[x][i]==1 && viz[i]==0)
            {
                u++;
                c[u]=i;
                viz[i]=1;
                pas[i]=pas[x]+1;
            }
            p++;
}
for (i=1;i<=u;i++)
    if(viz[i]==0) pas[i]=-1;
for (i=1;i<=u;i++)
    g<<pas[i]<<" ";
f.close();
g.close();
return 0;
}