Cod sursa(job #625726)
Utilizator | hiticasabel hiticas_abel | Data | 25 octombrie 2011 13:16:27 |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include<fstream>
#include<vector>
using namespace std;
int viz[100005],n,m,x,y,cont=-1;
double long a[10000][10000];
void citesc ()
{
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");
citesc();
df(1);
int i;
for(i=1;i<=n;i++)
if(viz[i]==0)
{
cont++;
df(i);
}
g<<cont;
g.close();
return 0;
}