Pagini recente » Cod sursa (job #907865) | Cod sursa (job #3243011) | Cod sursa (job #1131445) | Cod sursa (job #2855) | Cod sursa (job #1484401)
#include<fstream>
#include<vector>
using namespace std;
ifstream in("dfs.in");
ofstream out("dfs.out");
#define Nmax 100005
vector <int> lista[Nmax];
int N, M, ct=0;
int viz[Nmax]={0};
void dfs(int);
int main ()
{
int x, y;
in>>N>>M;
for(int i=1;i<=M;i++)
{
in>>x>>y;
lista[x].push_back(y);
lista[y].push_back(x);
}
for(int i=1; i<=N; i++)
{
if(viz[i] == 0)
{
ct++;
dfs(i);
}
}
out<<ct<<'\n';
return 0;
}
void dfs(int nod)
{
viz[nod]=1;
for(int i=0; i<lista[nod].size(); i++)
{
if( viz[ lista[nod][i] ] == 0)
dfs(lista[nod][i]);
}
}