Cod sursa(job #2438218)
Utilizator | Data | 11 iulie 2019 17:36:18 | |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int n,x,y,a[100002][100002],nrc,viz[100002],i,j,m;
void comp(int x)
{
int i;
viz[x] = 1;
for(i = 1 ; i <= a[x][0]; ++i)
if(viz[a[x][i]] == 0)
comp(a[x][i]);
}
int main()
{
f >> n >> m;
for(i = 1 ; i <= m ; ++i)
{ f >> x >> y;
a[x][0]++;
a[x][a[x][0]] = y;
a[y][0]++;
a[y][a[y][0]] = x;
}
for(i = 1 ; i <= n ; ++i)
if(viz[i] == 0){
nrc++;
comp(i);
}
g << nrc;
return 0;
}