Pagini recente » Cod sursa (job #2160119) | Cod sursa (job #2612366) | Cod sursa (job #3030293) | Cod sursa (job #1137267) | Cod sursa (job #3156419)
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
ifstream f("dfs.in");
ofstream o("dfs.out");
const int nmax = 10000;
vector<int> G[nmax];
int vis[nmax+1];
void DFS(int x){
vis[x]=1;
for(auto next:G[x])
{
if(!vis[next])DFS(next);
}
}
int main()
{
int n,m;
f >> n >> m;
for (int i = 1; i<=m; i++)
{
int x,y;
f>>x>>y;
G[x].push_back(y);
G[y].push_back(x);
}
int cc = 0;
for(int i = 1; i<=n; i++){
if(!vis[i]){
cc++;
DFS(i);
}
}
o<<cc;
}