Pagini recente » Cod sursa (job #882325) | Cod sursa (job #1292462) | Cod sursa (job #6702) | Cod sursa (job #73858) | Cod sursa (job #3156405)
#include<iostream>
#include<vector>
#include<fstream>
using namespace std;
const int NMAX = 10e5;
vector<int>G[NMAX];
int vis[NMAX+1];
ifstream fin("dfs.in");
ofstream fout("dfs.out");
void DFS(int x)
{
// cout << x << " ";
vis[x] = 1;
for(auto next : G[x])
{
if(!vis[next])
DFS(next);
}
}
int main()
{
int n, m;
fin >> n >> m;
for(int i=1 ;i<=m; i++)
{
int x, y;
fin >> 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);
}
}
fout << cc;
return 0;
}