Pagini recente » Cod sursa (job #2732735) | Cod sursa (job #2192978) | Cod sursa (job #1274644) | Cod sursa (job #894112) | Cod sursa (job #2560992)
#include <bits/stdc++.h>
#define hlo ios::sync_with_stdio(false); fin.tie(0); fout.tie(0);
using namespace std;
const int NMAX = 100005;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
vector < int > graf[NMAX];
vector < bool > vec(NMAX);
void DFS(int Nod)
{
vec[Nod] = 1;
for (int i = 0; i < graf[Nod].size(); ++i)
{
int neig = graf[Nod][i];
if (!vec[neig])
DFS(neig);
}
}
int main()
{
hlo
int n, m, x, y;
fin >> n >> m;
for (int i = 1; i <= m; ++i)
{
fin >> x >> y;
graf[x].push_back(y);
graf[y].push_back(x);
}
int conex = 0;
for (int i = 1; i <= n; ++i)
{
if (!vec[i]){
conex++;
DFS(i);
}
}
fout << conex;
}