Pagini recente » Cod sursa (job #871719) | Cod sursa (job #2476029) | Cod sursa (job #341742) | Cod sursa (job #3041878) | Cod sursa (job #2657988)
#include <iostream>
#include <fstream>
#include <vector>
#define MAXM 200001
#define MAXN 100001
#define uint unsigned int
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
vector <int> MC[MAXM];
bool went[MAXM];
int n,m,nrelconex;
void DFS(int nod){
went[nod]=1;
for(uint i=0;i<MC[nod].size();i++){
int next=MC[nod][i];
if(went[next]==false){
DFS(next);
}
}
}
int main(){
fin>>n>>m;
for(int i=1;i<=m;i++){
int x,y;
fin>>x>>y;
MC[x].push_back(y);
MC[y].push_back(x);
}
for(int i=1;i<=n;i++){
if(went[i]==0){
DFS(i);
nrelconex++;
}
}
fout<<nrelconex;
return 0;
}