Pagini recente » Cod sursa (job #1784477) | Cod sursa (job #632679) | Cod sursa (job #2076138) | Cod sursa (job #1211744) | Cod sursa (job #3257680)
#include <fstream>
#include <vector>
#include <queue>
#define NMAX 100002
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int N,M,S,viz[NMAX];
vector<int>v[NMAX],sol(NMAX,-1);
queue <int>q;
void citire()
{
int X,Y;
fin>>N>>M>>S;
for(int i=1; i<=M; i++)
{
fin>>X>>Y;
v[X].push_back(Y);
}
}
int main()
{
citire();
sol[S]=0;
q.push(S);
while(!q.empty())
{
int nod=q.front();
q.pop();
for(int i=0; i<v[nod].size(); i++)
{
if(sol[v[nod][i]]==-1)
{
sol[v[nod][i]]=1+sol[nod];
q.push(v[nod][i]);
}
}
}
for(int i=1; i<=N; i++)
{
fout<< sol[i] << " ";
}
fout<< "\n";
return 0;
}