Pagini recente » Cod sursa (job #1883644) | Cod sursa (job #1056018) | Cod sursa (job #2349997) | Cod sursa (job #1656227) | Cod sursa (job #1379792)
#include <iostream>
#include<fstream>
#include<vector>
#include<queue>
#define mx 100001
#define inf 0x3f3f3f3f
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector<int> v[mx];
int n,m,s,dist[mx];
queue<int> q;
bool viz[mx];
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]=true;
dist[s]=0;
while(!q.empty())
{
s=q.front();
q.pop();
for(unsigned int i=0;i<v[s].size();++i)
if(viz[v[s][i]]==false)
{
dist[v[s][i]]=dist[s]+1;
viz[v[s][i]]=true;
q.push(v[s][i]);
}
}
}
int main()
{
int i;
citire();
for(i=1;i<=n;i++)
dist[i]=inf;
bfs(s);
for(i=1;i<=n;i++)
if(dist[i]!=inf)
fout<<dist[i]<<" ";
else fout<<"-1 " ;
return 0;
}