Cod sursa(job #1622454)
Utilizator | Bia Beniamin beny10 | Data | 1 martie 2016 11:41:10 |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include<fstream>
using namespace std;
int n,m,x[10000][10000],viz[10000],res;
ifstream f("dfs.in");
ofstream g ("dfs.out");
void df(int node)
{
viz[node]=1;
for(int i=1;i<=n;++i)
{
if(x[node][i] && viz[i]==0)
{
df(i);
}
}
}
int main()
{
f>>n>>m;
int aux1,aux2;
for(int i=0;i<m;++i)
{
f>>aux1>>aux2;
x[aux1][aux2]=1;
x[aux2][aux1]=1;
}
for(int i=1;i<=n;++i)
{
if(viz[i]==0)
{
df(i);
res++;
}
}
g<<res;
return 0;
}