Pagini recente » Cod sursa (job #1904009) | Cod sursa (job #2602114) | Cod sursa (job #1780492) | Cod sursa (job #498910) | Cod sursa (job #2672877)
#include <bits/stdc++.h>
using namespace std;
bool viz[100001];
int n, m;
void dfs(int i, vector<vector<int>> adj){
if(viz[i] == false){
viz[i] = true;
for(int j = 0; j < adj[i].size(); j++)
if(viz[adj[i][j]] == false)
dfs(adj[i][j], adj);
}
}
int main()
{
cin >> n >> m;
vector<vector<int>> adj(n);
for(int i = 0; i < m; i++){
int x, y;
cin >> x >> y;
adj[x-1].push_back(y-1);
adj[y-1].push_back(x-1);
}
int cnt = 0;
for(int i = 0; i < n; i++){
if(viz[i] == false){
dfs(i, adj);
cnt++;
}
}
cout << cnt;
}