Pagini recente » Cod sursa (job #1963776) | Cod sursa (job #1246352) | Borderou de evaluare (job #1245466) | Cod sursa (job #2015324) | Cod sursa (job #2568656)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
const int NLIM=100005;
vector <int> muchii[NLIM];
int n,m,viz[NLIM];
int insula =0;
void DFS(int nod){
unsigned int i;
viz[nod]=1;
for(i=0;i<muchii[nod].size();i++){
int vecin=muchii[nod][i];
if(viz[vecin]==0)DFS(vecin);
}
}
void citire(){
fin>>n>>m;
for(int i=1;i<=m;i++){
int x,y;
fin>>x>>y;
muchii[x].push_back(y);
muchii[y].push_back(x);
}
for(int i=1;i<=n;i++){
if(viz[i]==0){insula+=1;DFS(i);}
}
}
int main()
{
citire();
fout<<insula<<endl;
return 0;
}