Cod sursa(job #1096165)
Utilizator | Alex Alex patratzel | Data | 1 februarie 2014 17:00:16 |
---|---|---|---|
Problema | BFS - Parcurgere in latime | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
unsigned n,m,s,a[10000][10000],i,c[10000],viz[10000],p,u,cost[10000];
void citeste()
{
unsigned x,y;
fin>>n>>m>>s;
for(i=1;i<=m;i++)
{
fin>>x>>y;
a[x][y]=1;
}
fin.close();
}
bool gasit(unsigned x)
{
for(unsigned q=1;q<=n;q++)
if(c[q]==x)
return true;
return false;
}
void parcurgere(unsigned x)
{
p=u=1;
viz[x]=1;
c[p]=x;
while(p<=u)
{
for(i=1;i<=n;i++)
if(a[c[p]][i]==1&&viz[i]==0)
{
cost[i]=p;
u++;
c[u]=i;
viz[i]=1;
}
p++;
}
}
int main()
{
citeste();
parcurgere(s);
//cout<<parcurgere(s,3)<<"\n";
/*for(i=1;i<=n;i++)
{ for(unsigned j=1;j<=n;j++)
cout<<a[i][j]<<" ";
cout<<"\n";
}
cout<<"\n";
for(i=1;i<=u;i++)
cout<<c[i]<<" ";
cout<<"\n";*/
for(i=1;i<=n;i++)
if(gasit(s))
fout<<cost[i]<<" ";
fout.close();
return 0;
}