Pagini recente » Cod sursa (job #2637679) | Cod sursa (job #1841191) | Cod sursa (job #1949364) | Cod sursa (job #2643141) | Cod sursa (job #2169760)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream in("dfs.in");
ofstream out("dfs.out");
int n, m, viz[100005], ct;
vector <int> v[100005];
void citire(){
in >> n >> m;
for(int i = 1; i <= m; i++){
int x, y;
in >> x >> y;
v[x].push_back(y);
v[y].push_back(x);
}
}
void DFS(int nod){
viz[nod] = 1;
for(int i = 0; i < v[nod].size(); i++){
int vec = v[nod][i];
if(viz[vec] == 0)
DFS(vec);
}
}
void afis(){
for(int i = 1; i <= n; i++)
if(viz[i] == 0){
DFS(i);
ct++;
}
out << ct;
}
int main()
{
citire();
afis();
return 0;
}