Pagini recente » Cod sursa (job #3217397) | Cod sursa (job #246527) | Cod sursa (job #2465018) | Cod sursa (job #1979431) | Cod sursa (job #3145814)
#include <iostream>
#include <vector>
using namespace std;
const int NMAX=1e5+2;
vector<int> adj[NMAX];
bool viz[NMAX];
void dfs(int nod)
{
viz[nod]=1;
for(auto& to : adj[nod])
{
if(!viz[to]){
dfs(to);
}
}
}
int main()
{
freopen("C:\\Users\\tudor\\CLionProjects\\clasa11\\dfs.in","r",stdin);
freopen("C:\\Users\\tudor\\CLionProjects\\clasa11\\dfs.out","w",stdout);
int n,m;
cin>>n>>m;
for(int i=1;i<=m;i++)
{
int x,y;
cin>>x>>y;
adj[x].push_back(y);
adj[y].push_back(x);
}
int nrComp=0;
for(int nod=1;nod<=n;nod++)
{
if(!viz[nod])
{
dfs(nod);
nrComp++;
}
}
cout<<nrComp<<'\n';
}