Pagini recente » Cod sursa (job #2837484) | Cod sursa (job #963938) | Cod sursa (job #2361419) | Cod sursa (job #2040460) | Cod sursa (job #2030841)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int n,m,cont;
vector<int> a[1000005];
int viz[1000005];
ifstream f("dfs.in");
ofstream g("dfs.out");
void DFS(int x){
for(auto y:a[x]){
if(viz[y]==0){
viz[y]=1;
DFS(y);
}
}
}
}
int main()
{
int x,y;
f>>n>>m;
for(int i=1;i<=m;i++){
f>>x>>y;
a[x].push_back(y);
a[y].push_back(x);
}
for(int i=1;i<=n;i++){
if(viz[i]==0){
++cont;
DFS(i);
}
}
g<<cont;
return 0;
}