Cod sursa(job #151603)
Utilizator | Data | 8 martie 2008 14:08:18 | |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 55 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<fstream>
using namespace std;
int n,m,a[200001][2],viz[100001],i,nr;
void df(int vf)
{
viz[vf]=1;
for(int i=1;i<=m;i++)
if(a[i][0]==vf && !viz[a[i][1]])
df(a[i][1]);
else
if(a[i][1]==vf && !viz[a[i][0]])
df(a[i][0]);
}
int main()
{
ifstream f("dfs.in");
ofstream g("dfs.out");
f>>n>>m;
for(i=1;i<=m;i++)
f>>a[i][0]>>a[i][1];
for(i=1;i<=n;i++)
if(!viz[i]){
nr++;
df(i);}
g<<nr;
g.close();
}