Cod sursa(job #550339)
Utilizator | Roventa Robert uara | Data | 9 martie 2011 13:35:53 |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include<iostream>
#include<fstream>
using namespace std;
fstream f("dfs.in",ios::in);
fstream g("dfs.out",ios::out);
int n,m,i,j,a[10000][10000],viz[10000],comp,x,y;
void DF(int k)
{
int i;
viz[k]=1;
for(i=1;i<=n;i++)
if(a[k][i]==1 && viz[i]==0 ) DF(i);
}
int main()
{
f>>n>>m;
for(i=1;i<=m;i++){
f>>x>>y;
a[x][y]=a[y][x]=1;
}
for(i=1;i<=n;i++)
{
if(viz[i]==0){
viz[i]=1;
DF(i);
comp++;
}
}
g<<comp;
f.close();
g.close();
return 0;
}