Pagini recente » Cod sursa (job #1873211) | Monitorul de evaluare | Cod sursa (job #3342505) | Cod sursa (job #3342190) | Cod sursa (job #1876275)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
const int MaxN=100005;
int N,M;
vector<int> G[MaxN];
bool viz[MaxN];
void Read();
void DFS(int x);
int main()
{
int cnt=0;
Read();
for(int i=1;i<=N;++i)
if(!viz[i])
{
DFS(i);
cnt++;
}
fout<<cnt<<'\n';
fout.close();
return 0;
}
void Read()
{
fin>>N>>M;
while(M--)
{
int x,y;
fin>>x>>y;
G[x].push_back(y);
G[y].push_back(x);
}
fin.close();
}
void DFS(int x)
{
viz[x]=true;
for(auto y : G[x])
if(!viz[y]) DFS(y);
}