Pagini recente » Cod sursa (job #1510818) | Cod sursa (job #2080433) | Cod sursa (job #1122290) | Cod sursa (job #838673) | Cod sursa (job #367869)
Cod sursa(job #367869)
#include<fstream>
using namespace std;
#define max 100001
int n,*a[max],d[max],s;
void read()
{
int m,i,j;
ifstream fin("bfs.in");
fin>>n>>m>>s;
for(int i=1;i<=n;i++)
{
a[i]=new int[n+1];
d[i]=-1;
}
for(;m;--m)
{
fin>>i>>j;
a[i][j]=1;
}
fin.close();
}
void bfs()
{
int *coada=new int [n+1],st=1,dr=1,i,k;
coada[1]=s;
d[s]=0;
while(st<=dr)
{
k=coada[st];
for(i=1;i<=n;i++)
if(a[k][i]==1&&d[i]==-1)
{
coada[++dr]=1;
d[i]=d[k]+1;
}
st++;
}
}
void write()
{
ofstream fout("bfs.out");
for(int i=1;i<=n;i++)
fout<<d[i];
fout.close();
}
int main()
{
read();
bfs();
write();
return 0;
}