Cod sursa(job #1259576)
| Utilizator | Data | 10 noiembrie 2014 10:47:22 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream fi("dfs.in");
ofstream fo("dfs.out");
int i,n,m,l,c,comp,nc;
bool a[20000][2000],v[20000];
void DFS(int x)
{
int i;
for(i=1;i<=n;i++)
if(a[x][i] and v[i]==false)
{
v[i]=true;
DFS(i);
}
}
int main()
{
fi>>n>>m;
for(i=1;i<=m;i++)
{
fi>>l>>c;
a[l][c]=a[c][l]=1;
}
nc=1;
for(i=1;i<=n;i++)
{
if(not v[i])
{
v[i]=true;
DFS(i);
comp++;
}
}
fo<<comp;
return 0;
}
