Cod sursa(job #615539)
Utilizator | Ana-Maria Catalina Georgescu AnaGeorgescu | Data | 9 octombrie 2011 22:54:50 |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include<fstream>
using namespace std;
ifstream fin ("dfs.in");
ofstream fout ("dfs.out");
int a[50][50],n;
int viz[50];
void citeste()
{
int x,y,m;
fin>>n;
fin>>m;
for(int i=1;i<=n;i++)
{
fin>>x>>y;
a[x][y]=a[y][x]=1;
}
fin.close();
}
int dfs (int x)
{
viz[x]=1;
for(int i=1;i<=n;i++)
if (a[x][i]==1 && viz[i]==0)
dfs(i);
}
int main ()
{ int c;
citeste ();
for(int i=1;i<=n;i++)
if (viz[i]==0)
{
c++;
dfs(i);
}
fout<<c;
fout.close();
return 0;
}