Pagini recente » Cod sursa (job #1695333) | Cod sursa (job #1168510) | Cod sursa (job #1160696) | Cod sursa (job #323816) | Cod sursa (job #2922276)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int dist[100005],viz[100005],s,n,m,x,y;
vector <int> V[100005];
deque <int> q;
int main()
{
fin>>n>>m>>s;
for(int i = 1;i<=m;i++)
{
fin>>x>>y;
V[x].push_back(y);
}
for(int i = 1;i<=n;i++)
dist[i] = -1;
q.push_back(s);
dist[s] = 0;
viz[s] = 1;
while(!q.empty())
{
int curent = q.front();
q.pop_front();
for(auto it:V[curent])
{
if(viz[it] == 0)
{
q.push_back(it);
viz[it] = 1;
dist[it] = dist[curent] + 1;
}
}
}
for(int i = 1;i<=n;i++)
fout<<dist[i]<<' ';
}