Cod sursa(job #2035296)
Utilizator | Panaete Adrian proflaurian | Data | 9 octombrie 2017 10:32:21 |
---|---|---|---|
Problema | BFS - Parcurgere in latime | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
const int N = 100010;
vector<int> v[N];
int n,m,s,i,j,dist[N];
queue<int> q;
int main()
{
f>>n>>m>>s;
for(; m; m--)
{
f>>i>>j;
v[i].push_back(j);
}
dist[s]=1;
q.push(s);
while(q.size())
{
int nod=q.front();
q.pop();
for(auto vec:v[nod])
if(!dist[vec])
{
dist[vec]=dist[nod]+1;
q.push(vec);
}
}
for(i=1;i<=n;i++)
g<<dist[i]-1<<' ';
return 0;
}