Pagini recente » Cod sursa (job #1488020) | Cod sursa (job #1830617) | Cod sursa (job #2275659) | Cod sursa (job #2303584) | Cod sursa (job #2809564)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int n, m;
bool viz[100005];
vector <int>g[100005];
void citire(){
fin >> n >> m;
int x, y;
for (int i = 1; i <= m; i++){
fin >> x >> y;
g[x].push_back(y);
g[y].push_back(x);
}
}
void dfs(int x){
viz[x] = 1;
for(auto &a: g[x])
if(!viz[a])
dfs(a);
}
void rezolvare(){
int nr = 0;
for(int i = 1; i <= n; i++)
if(!viz[i]){
nr++;
dfs(i);
}
fout << nr;
}
int main()
{
citire();
rezolvare();
return 0;
}