Pagini recente » Cod sursa (job #1121251) | Cod sursa (job #607838) | Cod sursa (job #2684469) | Cod sursa (job #2487265) | Cod sursa (job #615633)
Cod sursa(job #615633)
#include<fstream>
#include<vector>
using namespace std;
int n,m,s;
vector<int> a[10010];
int b[10010],c[10010];
void bfs(int k)
{
for(int i=0;i<=n;i++)
b[i]=-1;
int l=1;
b[k]=0;
c[1]=k;
for(int i=1;i<=l;i++)
for(int j=0;j<a[c[i]].size();j++)
if(b[a[c[i]][j]]==-1)
{
l++;
c[l]=a[c[i]][j];
b[c[l]]=b[c[i]]+1;
}
}
int main()
{
ifstream f("bfs.in");
ofstream g("bfs.out");
f>>n>>m>>s;
for(int i=1;i<=m;i++)
{
int x,y;
f>>x>>y;
a[x].push_back(y);
}
bfs(s);
for(int i=1;i<=n;i++)
g<<b[i]<<" ";
}