Pagini recente » Cod sursa (job #358196) | Cod sursa (job #840858) | Cod sursa (job #281363) | Rating Lechintan Tudor (TudorCristian2) | Cod sursa (job #2684068)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin ("dfs.in");
ofstream fout ("dfs.out");
vector <int> noduri[100005];
int vizitat[100005];
void dfs(int nod)
{
for(auto it : noduri[nod])
{
if(!vizitat[it])
{
vizitat[it]=1;
dfs(it);
}
}
}
int main()
{
int n,m,i,x,y;
cin>>n>>m;
for(i=1;i<=m;i++)
{
cin>>x>>y;
noduri[x].push_back(y);
noduri[y].push_back(x);
}
int cnt=0;
for(i=1;i<=n;i++)
{
if(!vizitat[i])
{
dfs(i);
cnt++;
}
}
cout<<cnt;
/** for(auto i=0;i<noduri[1].size();i++) ===== for(auto it : noduri[nod])
cout<<noduri[1][i]; */
return 0;
}