Pagini recente » Cod sursa (job #2480146) | Cod sursa (job #1720267) | Cod sursa (job #192509) | Cod sursa (job #2247632) | Cod sursa (job #2647461)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
const int NMAX = 1e5;
int N, M, nrc;
vector <int> g[NMAX + 5];
bool d[NMAX + 5];
void dfs(int node)
{
d[node] = 1;
for(auto it : g[node])
if(!d[it])
dfs(it);
}
int main()
{
fin >> N >> M;
for(int i = 1; i <= M; i++) {
int a, b; fin >> a >> b;
g[a].push_back(b);
g[b].push_back(a);
}
for(int i = 1; i <= N; i++)
if(!d[i]) {
nrc++;
dfs(i);
}
fout << nrc;
return 0;
}