Pagini recente » Cod sursa (job #695121) | Cod sursa (job #2642794) | Cod sursa (job #2650977) | Cod sursa (job #3174500) | Cod sursa (job #1482921)
#include <iostream>
#include <fstream>
#define nmax 100005
#include <vector>
using namespace std;
int n,m,l,dist[nmax],s[nmax],start,i,j;
ifstream f("bfs.in");
ofstream g("bfs.out");
vector <int> v[nmax];
void build()
{
int x,y;
f>>n>>m>>start;
for(i=1;i<=m;i++)
{f>>x>>y;
v[x].push_back(y);
}
}
void setup()
{
for(i=1;i<=n;i++)
dist[i]=-1;
}
void bfs(int inceput)
{
l= 1;
dist[inceput] = 0;
s[l]=inceput;
for(i=1;i<=l;i++)
for(j=0;j<v[s[i]].size();j++)
if(dist[v[s[i]][j]]==-1)
{
l++;
s[l]=v[s[i]][j];
dist[s[l]]=dist[s[i]]+1;
}
}
int main()
{
build();
setup();
bfs(start);
for(i=1;i<=n;i++)
g<<dist[i]<<" ";
return 0;
}