Pagini recente » Cod sursa (job #2284049) | Cod sursa (job #1865464) | Cod sursa (job #2449990) | Cod sursa (job #255042) | Cod sursa (job #2486229)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
vector <int> g[100001];
bool f[100000];
int n, m;
void dfs(int u){
int i, v;
f[u]=true;
for(i=0; i<g[u].size(); i++){
v=g[u][i];
if(!f[v])
dfs(v);
}
}
int main(){
int a, b, cnt;
fin>>n>>m;
for(int i=0; i<m; i++){
fin>>a>>b;
g[a].push_back(b);
g[b].push_back(a);
}
cnt=0;
for(int i=1; i<=n; i++){
if(!f[i]){
dfs(i);
cnt++;
}
}
fout<<cnt;
return 0;
}