Pagini recente » Cod sursa (job #2295593) | Cod sursa (job #2941787) | Cod sursa (job #1702742) | Cod sursa (job #1343881) | Cod sursa (job #2189579)
#include <bits/stdc++.h>
#define oo 10000000
using namespace std;
int n, m, rad, dis[100020], viz[100020];
vector <int> L[100020];
void Citire()
{
int x, y;
ifstream in("bfs.in");
in >> n >> m >> rad;
for(int i = 1; i <= m; i++)
{
in >> x >> y;
L[x].push_back(y);
}
in.close();
}
void Bfs_Dij()
{
int i, j;
for(i = 1; i <= n; i++)
dis[i] = oo;
dis[rad] = 0;
queue <int> q;
q.push(rad);
while(!q.empty())
{
j = q.front();
q.pop();
viz[j] = 1;
for(auto i : L[j])
{
if(!viz[i])q.push(i);
if(dis[i] > dis[j] + 1)
dis[i] = dis[j] + 1;
}
}
ofstream out("bfs.out");
for(i = 1; i <= n; i++)
if(viz[i])out << dis[i] << " ";
else out << "-1 ";
/*
for(pas = 1; pas < n; pas++)
{
j = 0;
for(i = 1; i <= n; i++)
if(dis[j] > dis[i])j = i;
viz[j] = 1;
}
*/
}
int main()
{
Citire();
Bfs_Dij();
return 0;
}