Pagini recente » Cod sursa (job #1661699) | Cod sursa (job #2858648) | Cod sursa (job #1028005) | Cod sursa (job #352730) | Cod sursa (job #2072954)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n,m,s,a,b,d[100001];
vector<int>adj[100001];
void bfs(int nod,int dist)
{
d[nod]=dist;
for(int i=0; i<adj[nod].size(); i++)
{
if(dist+1<d[adj[nod][i]] or d[adj[nod][i]]==-1)
{
bfs(adj[nod][i],dist+1);
}
}
}
int main()
{
f>>n>>m>>s;
for(int i=1; i<=n; i++)
{
d[i]=-1;
}
for(int i=1; i<=m; i++)
{
f>>a>>b;
adj[a].push_back(b);
}
bfs(s,0);
for(int i=1; i<=n; i++)
{
g<<d[i]<<" ";
}
return 0;
}