Cod sursa(job #614429)
Utilizator | costiniulia costiniulia | Data | 6 octombrie 2011 15:20:07 |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include<fstream>
using namespace std;
int viz[100005],n,m,x,y,cont=1;
double long a[10000][10000];
void citire()
{
ifstream f("dfs.in");
f>>n>>m;
int l;
for(l=1;l<=m;l++)
{
f>>x>>y;
a[x][y]=1;
a[y][x]=1;
}
f.close();
}
void df(int k)
{int i ;
viz[k]=1;
for(i=1;i<=n;i++)
if(viz[i]==0 && a[k][i]==1)
df(i);
}
int main()
{
ofstream g("dfs.out");
citire();
df(1);
int i;
for(i=1;i<=n;i++)
if(viz[i]==0)
{
cont++;
df(i);
}
g<<cont;
g.close();
return 0;
}