Pagini recente » Borderou de evaluare (job #2709777) | Borderou de evaluare (job #1498675) | Borderou de evaluare (job #1251550) | Borderou de evaluare (job #2022626) | Cod sursa (job #2552986)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int N,M,poz[100010],viz[100010],nr;
vector <int> v[100010];
void dfs(int nod)
{
int i;
viz[nod]=1;
for(i=0;i<v[nod].size();i++)
{
if(viz[v[nod][i]]==0)
{
dfs(v[nod][i]);
}
}
}
int main()
{
int x,y,i;
fin>>N>>M;
for(i=1;i<=M;i++)
{
fin>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
for(i=1;i<=N;i++)
{
if(viz[i]==0)
{dfs(i);nr++;}
}
fout<<nr;
}