Cod sursa(job #741046)
Utilizator | Data | 25 aprilie 2012 10:56:23 | |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 5 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include<fstream>
using namespace std;
int V[10000],n,m,M[10000][10000];
ifstream f("dfs.in");
ofstream g("dfs.out");
int x,y,nr;
void citesc()
{
f>>n>>m;
int i;
for(i = 1;i<=m;++i)
{
f>>x>>y;
M[x][y] = M[y][x] = 1;
}
}
int df(int nod)
{
int i;
V[nod] = 1;
for(i = 1;i<=n;++i)
{
y = M[nod][i];
if(!V[y])
df(y);
}}
int main()
{
citesc();
int i;
for(i = 1;i<=n;++i)
if(!V[i])
{
++nr;
df(i);
}
g<<nr;
f.close();
g.close();
return 0;
}