Cod sursa(job #2736900)
Utilizator | Dragan Andrei AndreiD31 | Data | 4 aprilie 2021 10:18:10 |
---|---|---|---|
Problema | BFS - Parcurgere in latime | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.71 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
vector<int>v[100100];
queue<int>q;
int n,i,m,s,x,nod,vecin,y,viz[100100];
int main()
{
f>>n>>m>>s;
for(i=1;i<=m;i++)
{
f>>x>>y;
v[x].push_back(y);
}
for(i=1;i<=n;i++)viz[i]=-1;
q.push(s);
viz[s]=0;
while(!q.empty())
{
nod=q.front();
q.pop();
for(i=0;i<v[nod].size();i++)
{
vecin=v[nod][i];
if(viz[vecin]==-1)
{
viz[vecin]=viz[nod]+1;
q.push(vecin);
}
}
}
for(i=1;i<=n;i++)g<<viz[i]<<" ";
return 0;
}