Pagini recente » Borderou de evaluare (job #2501400) | Cod sursa (job #2936483) | Cod sursa (job #1361975)
#include <iostream>
#include<vector>
#include<queue>
#include<fstream>
using namespace std;
ifstream fin("bfs.in");
vector<int> v[10005];
queue<int> q;
int viz[10005],len[10005];
int n,m,s;
void citire()
{
int i,x,y;
fin>>n>>m>>s;
for(i=1;i<=m;i++)
{
fin>>x>>y;
v[x].push_back(y);
}
}
void bfs(int s)
{
q.push(s);
viz[s]=1;
len[s]=0;
while(!q.empty())
{
s=q.front();
q.pop();
for(int i=0;i<v[s].size();++i)
if(viz[v[s][i]]==0)
{
viz[v[s][i]]=1;
q.push(v[s][i]);
len[v[s][i]]=len[s]+1;
}
}
}
int main()
{
int i;
citire();
for(i=1;i<=n;i++)
len[i]=-1;
bfs(s);
for(i=1;i<=n;i++)
cout<<len[i]<<" ";
return 0;
}