Pagini recente » Cod sursa (job #174387) | Cod sursa (job #2831278) | Cod sursa (job #625503) | Cod sursa (job #1257242) | Cod sursa (job #1737655)
#include <iostream>
#include <queue>
#include <fstream>
#define NR 1000000
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
vector <int>G[NR];
vector <int> ::iterator it;
queue <int>varfuri;
int n,m,s,viz[NR];
void citire()
{
f>>n>>m>>s;
for(int i=0; i<m; i++)
{
int x,y;
f>>x>>y;
G[x].push_back(y);
}
}
void bfs(int NOD)
{
varfuri.push(NOD);
viz[NOD]=1;
while(!varfuri.empty())
{
int varfCurent=varfuri.front();
varfuri.pop();
for(it=G[varfCurent].begin(); it!=G[varfCurent].end(); it++)
if(viz[*it]==0)
{
viz[*it]=viz[varfCurent]+1;
varfuri.push(*it);
}
}
}
void afisare()
{
for(int i=1;i<=n;i++)
g<<viz[i]-1<<" ";
}
int main()
{
citire();
bfs(s);
afisare();
return 0;
}