Pagini recente » Cod sursa (job #1809293) | Cod sursa (job #883382) | Cod sursa (job #1167326) | Cod sursa (job #2517021) | Cod sursa (job #2438504)
#include <iostream>
#include <fstream>
#include <vector>
#include <assert.h>
using namespace std;
ifstream fi("dfs.in");
ofstream fo("dfs.out");
#define dim 100010
vector <long int> G[dim];
int viz[dim];
long int n,m;
long int nr;
void dfs(long int nod)
{
viz[nod]=1;
for(long int i=0;i<G[nod].size();i++)
if(viz[G[nod][i]]==0)
dfs(G[nod][i]);
}
int main()
{
fi>>n>>m;
for(long int i=1;i<=m;i++)
{
long int x,y;
fi>>x>>y;
G[x].push_back(y);
G[y].push_back(x);
}
for(long int i=1;i<=n;i++)
if(!viz[i])
{dfs(i);
++nr;}
fo<<nr;
return 0;
}