Pagini recente » Cod sursa (job #3213843) | Cod sursa (job #2775945) | Cod sursa (job #1154254) | Cod sursa (job #2179718) | Cod sursa (job #2112533)
#include <iostream>
#include <fstream>
#include <vector>
#include <string.h>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int n,m,ct;
vector<int>G[100005];
void read()
{
f>>n>>m;
for(int i=1;i<=n;i++)
{
int x,y;
f>>x>>y;
G[x].push_back(y);
G[y].push_back(x);
}
}
bool viz[100005];
void dfs(int x)
{
viz[x]=1;
for(int i=0;i<(int)G[x].size();i++)
{ int vecin=G[x][i];
if(!viz[vecin])
{
dfs(vecin);
}
}
}
int main()
{
read();
for(int i=1;i<=n;i++)
if(!viz[i]) ct++,dfs(i);
g<<ct;
return 0;
}