parcurgere graf in adancime recursiv

Sa se parcurga in adancime DF un graf orientat.

Graful este dat prin matricea de adiacenta.

#include<fstream.h>
#include<iostream.h>
int v[20],a[20][20],n;
void citire()
{
int i,j;
fstream f(“matrice.txt”,ios::in);
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>a[i][j];
}
void df(int nod)
{
int k;
cout<<nod<<” “;
v[nod]=1;
for(k=1;k<=n;k++)
if((a[nod][k]==1) && (v[k]==0))
df(k);
}
void main()
{
citire();
df(1);
}

{joscommentenable}

Leave a Reply