Pagini recente » Cod sursa (job #1424852) | Cod sursa (job #497426) | Cod sursa (job #2386885) | Cod sursa (job #36589) | Cod sursa (job #2337152)
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
const int N=100005;
vector<int> a[N];
int n,m,x0,d[N],q[N];
void citire()
{
int i,x,y;
in>>n>>m>>x0;
for(i=1;i<=m;i++)
{
in>>x>>y;
a[x].push_back(y);
}
}
void BFS()
{
int p=0,u=-1,i,x,y;
d[x0]=0;
q[++u]=x0;
while(p<=u)
{
x=q[p++];
for(i=0;i<a[x].size();i++)
{
y=a[x][i];
if(d[y]==-1)
{
d[y]=d[x]+1;
q[++u]=y;
}
}
}
}
int main()
{
int i;
citire();
for(i=1;i<=n;i++)
d[i]=-1;
BFS();
for(i=1;i<=n;i++)
out<<d[i]<<" ";
return 0;
}