Cod sursa(job #688265)
Utilizator | Stefan Cenusa StefanCenusa | Data | 23 februarie 2012 13:11:58 |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
#define NMAX 1008
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int LA[NMAX][NMAX],viz[NMAX],n,m;
void citire()
{
int i,x,y;
fin>>n>>m;
for (i=1; i<=m; i++)
{
fin>>x>>y;
LA[x][++LA[x][0]]=y;
LA[y][++LA[y][0]]=x;
}
}
void dfs (int x)
{
viz[x]=1;
for (int i=1; i<=LA[x][0]; i++)
if (viz[LA[x][i]]==0)
dfs(LA[x][i]);
}
int main()
{
int c=1;
citire();
for (int i=1; i<=n; i++)
if (viz[i]==0)
{
c++;
dfs(i);
}
fout<<c-1<<'\n';
return 0;
}