Cod sursa(job #414333)
Utilizator | Data | 9 martie 2010 22:40:42 | |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream.h>
int e1,e2,i,n,m,v[1005],a[1005][1005],nr=0;
int DFS(int x)
{
v[x]=1;
for(int j=1;j<=n;j++)
if(a[x][j] && !v[j])
DFS(j);
}
int main()
{
ifstream f("dfs.in");
ofstream g("dfs.out");
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>e1>>e2;
a[e1][e2]=a[e2][e1]=1;
}
for(i=1;i<=n;i++)
if(!v[i])
{
nr++;
DFS(i);
}
g<<nr;
}