Pagini recente » Cod sursa (job #797555) | Cod sursa (job #2016666) | Cod sursa (job #1181219) | Cod sursa (job #22075) | Cod sursa (job #1989170)
#include <fstream>
#include <vector>
#include <queue>
#define DIM 100001
using namespace std;
ifstream fi("bfs.in");
ofstream fo("bfs.out");
int n,m,s;
vector<int> V[DIM];
int VIZ[DIM];
int x,y;
queue<int> Q;
int main()
{
fi>>n>>m>>s;
for(int i=1;i<=m;i++)
{
fi>>x>>y;
V[x].push_back(y);
}
Q.push(s);
VIZ[s]=1;
while(!Q.empty())
{
x=Q.front();
for(int i=0;i<V[x].size();i++)
if(VIZ[V[x][i]]==false)
{
VIZ[V[x][i]]=1+VIZ[x];
Q.push(V[x][i]);
}
Q.pop();
}
for(int i=1;i<=n;i++)
fo<<VIZ[i]-1<<" ";
fi.close();
fo.close();
return 0;
}