Pagini recente » Cod sursa (job #1015362) | Cod sursa (job #976305) | Cod sursa (job #1734179) | Cod sursa (job #2658652) | Cod sursa (job #1717690)
#include <stdio.h>
#include <vector>
#define N 100005
using namespace std;
int n, m;
vector <int> g[N];
bool vis[N];
void citire()
{
int x , y;
freopen("dfs.in","r",stdin);
freopen("dfs.out","w",stdout);
scanf("%d %d", &n , &m);
for(int i = 1 ; i <= m ; i++)
{
scanf("%d %d",&x,&y);
g[x].push_back(y);
g[y].push_back(x);
}
}
void dfs(int x)
{
vector <int> :: iterator it;
vis[x] = true;
for(it = g[x].begin(); it != g[x].end(); ++it)
{
if(!vis[*it])
dfs(*it);
}
}
void parcurgere()
{
int raspuns = 0 ;
for(int i = 1 ; i <= n ; i++)
{
if(!vis[i])
{
dfs(i);
raspuns++;
}
}
printf("%d",raspuns);
}
int main()
{
citire();
parcurgere();
return 0;
}