Pagini recente » Cod sursa (job #976908) | Cod sursa (job #1803929) | Cod sursa (job #1069975) | Cod sursa (job #2752861) | Cod sursa (job #2702162)
#include <fstream>
#include <vector>
#include <iostream>
using namespace std;
int n;
vector<int> a[100001];
bool viz[100001];
void dfs(int x) {
int i;
viz[x] = 1;
for (i = 0; i < a[x].size(); i++)
if (!viz[a[x][i]])
dfs(a[x][i]);
}
int main() {
int m, i, x, y, nr = 0;
ifstream f("dfs.in");
f >> n >> m;
for (i = 1; i <= m; i++) {
f >> x >> y;
a[x].push_back(y);
a[y].push_back(x);
}
f.close();
for (i = 1; i <= n; i++)
if (!viz[i]) {
dfs(i);
nr++;
}
ofstream g("dfs.out");
g << nr;
g.close();
return 0;
}