Pagini recente » Cod sursa (job #130851) | Cod sursa (job #1637900) | Cod sursa (job #2650895) | Cod sursa (job #2028729) | Cod sursa (job #2083985)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
const int N=100010;
unsigned int n, m, x, y, sis, vizitat[N];
vector<int> graf[N];
void g_fill(unsigned int i)
{
vizitat[i]=1;
for(auto j=0;j<graf[i].size();j++)
{
if(vizitat[graf[i][j]]==0)
{
g_fill(graf[i][j]);
}
}
}
int main()
{
fin>>n>>m;
for(unsigned i=1;i<=m;i++)
{
fin>>x>>y;
graf[x].push_back(y);
graf[y].push_back(x);
}
for(unsigned i=1;i<=n;i++)
{
if(vizitat[i]==0)
{
g_fill(i);
sis=sis+1;
}
}
fout<<sis;
return 0;
}