Pagini recente » Cod sursa (job #1516282) | Borderou de evaluare (job #1569650) | Cod sursa (job #1392631) | Cod sursa (job #2817791) | Cod sursa (job #2886910)
#include<fstream>
#include <vector>
using namespace std;
ifstream cin ("dfs.in");
ofstream cout("dfs.out");
int n,m, insule = 0;
const int NLIM = 100005;
bool vizitat[NLIM];
vector <int> Muchii[NLIM];
void dfs(int k){
vizitat[k] = 1;
for (unsigned int i = 0; i <Muchii[k].size();++i){
int vecin = Muchii[k][i];
if (!vizitat[vecin]){
dfs(vecin);
}
}
}
void citire(){
cin >> n >> m;
for (int i = 1; i <=m;++i)
{
int x,y;
cin >> x >> y;
Muchii[x].push_back(y);
Muchii[y].push_back(x);
}
for (int i = 1; i <=n;++i){
if (!vizitat[i]){
insule++;
dfs(i);
}
}
}
int main(){
citire();
cout << insule << "\n";
}