Cod sursa(job #1092836)
Utilizator | Darius Bucsa dariusbucsa | Data | 27 ianuarie 2014 14:53:12 |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include<fstream>
using namespace std;
ifstream cin("input.in");
ofstream cout("output.out");
int a[20][20], i, j, n, viz[100], k=0;
void citire()
{ int i, j;
cin>>n;
for(i=1; i<=n; i++)
{for(j=1; j<=n; j++)
cin>>a[i][j];
}
}
void df(int nod)
{ int i;
viz[nod]=1;
for(i=1; i<=n; i++)
{
if(a[nod][i]==1 && viz[i]==0)
df(i); }
}
int main()
{ int ok;
citire();
df(1);
//ok=1;
for(i=1; i<=n; i++)
{ if(viz[i]==0)
df(i);
k++;
}
cout<<k;
cin.close();
cout.close();
return 0;
}