Pagini recente » Cod sursa (job #973683) | Cod sursa (job #1442097) | Cod sursa (job #2936249) | Cod sursa (job #1611698) | Cod sursa (job #1418055)
#include <vector>
#include <fstream>
#define MAX 100001
using namespace std;
vector<int> v[MAX];
int vizitat[MAX];
void DFS(int x);
int main() {
int n, m, i, j, k, x, y, nr;
ifstream fin("dfs.in");
fin >> n >> m;
for (i = 0; i < m; ++i) {
fin >> x >> y;
v[x].push_back(y);
v[y].push_back(x);
}
nr = 0;
for (i = 1; i <= n; ++i) {
if (vizitat[i] == 0) {
DFS(i);
++nr;
}
}
fin.close();
ofstream fout("dfs.out");
fout << nr << '\n';
fout.close();
return 0;
}
void DFS(int x) {
int i;
vizitat[x] = 1;
for (i = 0; i < v[x].size(); ++i) {
if (vizitat[v[x][i]] == 0)
DFS(v[x][i]);
}
}