Pagini recente » Cod sursa (job #1504873) | Cod sursa (job #3300592) | Cod sursa (job #2733959) | Cod sursa (job #736423) | Cod sursa (job #2663673)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
const int NMAX = 100005;
vector<int> muchii[NMAX];
int viz[NMAX];
void dfs(int nod) {
viz[nod] = 1;
for (auto &nodcrt : muchii[nod]) {
if (viz[nodcrt] == 0) {
dfs(nodcrt);
}
}
}
int main() {
int n,m;
fin >> n >> m;
for (int i=0; i<m; i++) {
int x,y;
fin >> x >> y;
muchii[x].push_back(y);
muchii[y].push_back(x);
}
int nrcomp = 0;
for (int i=1; i<=n; i++) {
if (viz[i] == 0) {
nrcomp++;
dfs(i);
}
}
fout << nrcomp;
return 0;
}