Pagini recente » Cod sursa (job #1807720) | Cod sursa (job #540226) | Borderou de evaluare (job #3134416) | Borderou de evaluare (job #2760144) | Cod sursa (job #2626787)
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n,m,a,v[100010];
vector<int>vect[100010];
queue<int>q;
void bfs()
{
q.push(a);
while(!q.empty())
{
int n1=q.front();
q.pop();
for(int i=0;i<vect[a].size();i++)
if(v[vect[a][i]]==-1)
{
v[vect[n1][i]]=v[a]+1;
q.push(vect[a][i]);
}
}
}
int main()
{
f>>n>>m>>a;
for(int i=1;i<=m;i++)
{
int x,y;
f>>x>>y;
vect[x].push_back(y);
}
for(int i=1;i<=n;i++)
v[i]=-1;
v[a]=0;
bfs();
for(int i=1;i<=n;i++)
g<<v[i]<<" ";
}