Pagini recente » Cod sursa (job #933206) | Cod sursa (job #836092) | Cod sursa (job #501532) | Cod sursa (job #1808774) | Cod sursa (job #1791242)
#include <fstream>
#include <vector>
#include <iterator>
#include <algorithm>
using namespace std;
ifstream cin("bfs.in");
ofstream cout("bfs.out");
int s;
vector <vector <int> > a;
vector <int> d;
void read()
{
int n,m,x,y;
cin >> n >> m >> s;
a.resize(n+1);
for ( ; m ; m--)
{
cin >> x >> y;
if (x!=y) a[x].push_back(y);
}
d.resize(n+1);
fill(d.begin(),d.end(),-1);
d[s]=0;
}
void solve()
{
vector <int> q;
q.push_back(s);
int x;
for (int i=0; i<q.size(); i++)
{
for (int j=0; j<a[q[i]].size(); j++)
{
x=a[q[i]][j];
if (d[x]==-1)
{
q.push_back(x);
d[x]=d[q[i]]+1;
}
}
}
}
main()
{
read();
solve();
copy(d.begin()+1,d.end(),ostream_iterator <int> (cout, " "));
}