Pagini recente » Cod sursa (job #1435292) | Diferente pentru schimbare-borland/alternativa intre reviziile 3 si 14 | Cod sursa (job #2037741) | Cod sursa (job #1192732) | Cod sursa (job #2167447)
#include <fstream>
#define NMAX 100002
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
struct nod
{
int vf;
struct nod* urm;
};
typedef struct nod* LSI;
LSI L[NMAX];
nod* p[NMAX];
bool uz[NMAX];
int n, m, start, i, nrp[NMAX];
void citire();
void BFS(int);
void inserare(LSI& L, int x, nod* p);
int main()
{
citire();
BFS(1);
return 0;
}
void citire()
{
int x, y, i;
fin>>n>>m;
fin>>start;
for (i=1; i<=m; i++)
{
fin>>x>>y;
inserare(L[x], y, p[x]);
if (p[x]==NULL)
p[x]=L[x];
else
p[x]=p[x]->urm;
}
}
void BFS(int start)
{
int C[NMAX], x, prim, ultim;
nod* q;
C[0]=start;
prim=ultim=0;
uz[start]=1;
while(prim<=ultim)
{
x=C[prim++];
for(q=L[x]; q; q=q->urm)
if(!uz[q->vf])
{
uz[q->vf]=1;
C[++ultim]=q->vf;
nrp[q->vf]=nrp[x]+1;
}
}
}
void inserare(LSI& L, int x, nod* p)
{
nod* q = new nod;
q->vf=x;
if (p==NULL)
{
q->urm=L;
L=q;
}
else
{
q->urm = p->urm;
p->urm = q;
}
}