Pagini recente » Cod sursa (job #1303798) | Cod sursa (job #1898742) | Cod sursa (job #1319113) | Cod sursa (job #1774895) | Cod sursa (job #1423181)
#include <fstream>
using namespace std;
ifstream in ("bfs.in");
ofstream out ("bfs.out");
int a[10000][10000], viz[10000];
int main()
{
int n, m, s, cod[10000], inc, sf, i, e;
in >> n >> m >> s;
for(i=1; i<=n; i++)
{
viz[i]=-1;
}
viz[s]=0;
for(i=0; i<m; i++)
{
in >> inc >> sf;
a[inc][sf]=1;
}
inc=sf=1;
cod[inc]=s;
while(inc<=sf)
{
inc++;
for(i=1; i<=n; i++)
{
if(a[cod[inc-1]][i]==1&&viz[i]==-1)
{
sf++;
cod[sf]=i;
viz[i]=viz[cod[inc-1]]+1;
}
}
}
for(i=1; i<=n; i++)
{
out << viz[i] << " ";
}
return 0;
}