Cod sursa(job #2462306)
Utilizator | Bogdan Gavra gavra_bogdan | Data | 27 septembrie 2019 08:31:48 |
---|---|---|---|
Problema | BFS - Parcurgere in latime | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.67 kb |
#include <bits/stdc++.h>
using namespace std;
vector<int>l[100005];
int d[100005];
queue<int>q;
void build_bfs(int nod)
{
q.push(nod);
d[nod]=0;
while(!q.empty())
{
int x=q.front();
q.pop();
for(int i=0;i<l[x].size();i++)
if(d[l[x][i]]==-1)
{
d[l[x][i]]=d[x]+1;
q.push(l[x][i]);
}
}
}
int main()
{
int n,m,a,b,nod;
cin>>n>>m>>nod;
for(int i=1;i<=m;i++)
{
cin>>a>>b;
l[a].push_back(b);
}
memset(d,-1,sizeof(d));
build_bfs(nod);
for(int i=1;i<=n;i++)
cout<<d[i]<<" ";
return 0;
}