Pagini recente » Borderou de evaluare (job #2565331) | Cod sursa (job #3161873)
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
vector<int> edges[100005];
int dist[100005];
void bfs(int s)
{
queue<int> q;
q.push(s);
while (q.empty() == false)
{
int x = q.front();
q.pop();
for (auto u: edges[x])
{
if (dist[u] == 0)
{
q.push(u);
dist[u] = dist[x] + 1;
}
}
}
}
int main()
{
freopen("bfs.in", "r", stdin);
freopen("bfs.out", "w", stdout);
int n, m, s;
cin >> n >> m >> s;
while (m--)
{
int x, y;
cin >> x >> y;
edges[x].push_back(y);
}
bfs(s);
cout<<"ok;;"
for (int z = 1; z <= n; z++)
{
cout << dist[z] << " ";
}
return 0;
}