Pagini recente » Cod sursa (job #2493167) | Cod sursa (job #2079480) | Cod sursa (job #2876043) | Cod sursa (job #2307598) | Cod sursa (job #2896890)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
#define DIM 100001
bool culoare[DIM];
int n,m,u,v,ans;
vector<int> list[DIM];
void dfs(int nod){
culoare[nod]=1;
for(int i=0;i<list[nod].size();i++){
if(culoare[list[nod][i]]==0){
dfs(list[nod][i]);
}
}
}
int main(){
ifstream fin("dfs.in");
ofstream fout("dfs.out");
fin>>n>>m;
for(int i=1;i<=m;i++){
fin>>u>>v;
list[u].push_back(v);
list[v].push_back(u);
}
for(int i=1;i<=n;i++){
if(culoare[i]==0){
dfs(i);
ans++;
}
}
fout<<ans;
}
/*
6 3
1 2
1 4
3 5
*/