Pagini recente » Cod sursa (job #1594457) | Cod sursa (job #2853167) | runda/asta_i_pt_shumen | Cod sursa (job #2705952) | Cod sursa (job #2200559)
#include <fstream>
using namespace std;
ifstream fin ("bfs.in");
ofstream fout ("bfs.out");
int n, m,d[200005], S;
bool a[1005][1005];
void Citire()
{
int i,x,y;
fin>>n>>m>>S;
for( i= 1 ; i <= m ; i++)
{
fin>>x>>y;
a[x][y]=1;
}
}
void Init()
{
for( int i = 1 ; i <= n ;i++)
d[i]=-1;
d[S]=0;
}
void DFS( int k)
{
for(int i = 1 ; i <= n ; i++)
if(a[k][i]==1)
{
if(d[i]==-1 || d[i]>d[k]+1)
{
d[i]=d[k]+1;
DFS(i);
}
}
}
int main()
{
Citire();
Init();
int i;
DFS(S);
for( i = 1 ;i <= n ; i++)
fout<<d[i]<<" ";
fout<<"\n";
return 0;
}