Pagini recente » Cod sursa (job #912584) | Cod sursa (job #1934870) | Cod sursa (job #1740754) | Cod sursa (job #231193) | Cod sursa (job #1411169)
#include <stdio.h>
#include <vector>
using namespace std;
int n, m, s, d[100100], c[100100], k, viz[100100];
vector<int> l[100100];
FILE*f=fopen("bfs.in","r"),*g=fopen("bfs.out","w");
void BFS()
{
int u = 1, p = 1;
c[1] = s;
viz[s] = 1;
while(p <= u)
{
for(int i = 0; i < l[c[p]].size(); i++)
{
if(viz[l[c[p]][i]] == 0)
{
c[++u] = l[c[p]][i];
d[c[u]] = d[c[p]] + 1;
viz[l[c[p]][i]] = 1;
}
}
p++;
}
}
void afisare()
{
for(int i = 1;i <= n; i++)
if(d[i] == 0 && i != s)
fprintf(g,"-1 ");
else
fprintf(g,"%d ",d[i]);
}
int main()
{
int x, y;
fscanf(f,"%d %d %d\n",&n, &m, &s);
for(int i = 1; i <= m; i++)
{
fscanf(f,"%d %d\n",&x,&y);
l[x].push_back(y);
}
BFS();
afisare();
return 0;
}