Pagini recente » Cod sursa (job #2114976) | Cod sursa (job #1487814) | Cod sursa (job #1396648) | Cod sursa (job #2684491) | Cod sursa (job #672270)
Cod sursa(job #672270)
#include<cstdio>
#include<vector>
using namespace std;
const char in[]="dfs.in";
const char out[]="dfs.out";
const int N = 100005;
vector<int>G[N];
int ok[N], sol, n, m, x ,y;
void dfs(int x)
{
ok[x] = true;
for(int i = 0 ; i < G[x].size() ; ++i)
if(!ok[ G[ x ][ i ] ])dfs(G[x][i]);
}
int main()
{
freopen(in,"r",stdin);
freopen(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);
}
for(int i = 1 ; i <= n ; ++i)
if(!ok[i])dfs(i), ++sol;
printf("%d\n", sol);
return 0;
}