Cod sursa(job #2032504)
Utilizator | Todirisca Cezar CezarTD | Data | 5 octombrie 2017 09:44:22 |
---|---|---|---|
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,x,y,s,dist[N];
queue<int> q;
int main()
{
f>>n>>m>>s;
for(; m; m--)
{
f>>x>>y;
v[x].push_back(y);
}
dist[s]=1;
q.push(s);
while(q.size())
{
x=q.front();
q.pop();
for(auto vec:v[x])
if(!dist[vec])
{
dist[vec]=dist[x]+1;
q.push(vec);
}
}
for(x=1;x<=n;x++)
g<<dist[x]-1<<' ';
return 0;
}