Pagini recente » Cod sursa (job #727874) | Cod sursa (job #2799429) | Cod sursa (job #67829) | Cod sursa (job #2359982) | Cod sursa (job #2195579)
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
queue <int> q;
vector <int> g[100001];
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n,m,s;
int viz[100001];
void citire()
{
int x,y;
fin>>n>>m>>s;
for(int i=0;i<m;i++)
{
fin>>x>>y;
g[x].push_back(y);
}
}
void leesmecher()
{q.push(s);
while (!q.empty())
{
int x=q.front();
q.pop();
for (auto &v:g[x])
{
if (viz[v]==0)
{
viz[v]=viz[x]+1;
q.push(v);
}
}
}
}
int main()
{
citire();
viz[s]=1;
leesmecher();
for (int i=1; i<=n; i++)
fout << viz[i]-1 <<' ';
return 0;
}