Pagini recente » Cod sursa (job #1303240) | Cod sursa (job #2627767) | Cod sursa (job #122195) | Cod sursa (job #717132) | Cod sursa (job #2195573)
#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
#define maxu 100005
using namespace std;
int n,m,s,pasi[maxu];
queue < int > q;
vector < int > g[maxu];
void citire()
{
int x, y;
ifstream f("dfs.in");
f>>n>>m;
for(int i=0; i<m; i++)
{
f>>x>>y;
g[x].push_back(y);
g[y].push_back(x);
}
}
void dfs(int x)
{
pasi[x]=1;
for(auto &v:g[x])
if(!pasi[v])
dfs(v);
}
int main()
{
ofstream g("dfs.out");
citire();
int nr=0;
for(int i=1;i<=n;i++)
{
if(!pasi[i])
{
dfs(i);
nr++;
}
}
g<<nr;
return 0;
}