Pagini recente » Cod sursa (job #2364068) | Cod sursa (job #1778906) | Istoria paginii runda/live | Cod sursa (job #1335260) | Cod sursa (job #2787838)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
vector<vector<int>>G;
vector<bool>v;
int n,m;
void citeste()
{
int x,y;
fin>>n>>m;
G=vector<vector<int>>(n+1);
v=vector<bool>(n+1);
for(int i=1; i<=m; i++)
{
fin>>x>>y;
G[x].push_back(y);
G[y].push_back(x);
}
}
void DFS(int x)
{
v[x]=1;
for(auto i:G[x])
if(!v[i])
DFS(i);
}
int main()
{
int nr=0;
read();
for(int i=1; i<=n; i++)
{
if(!v[i])
{
nr++;
DFS(i);
}
}
fout<<nr;
}