Pagini recente » Cod sursa (job #1557929) | Cod sursa (job #730024) | Cod sursa (job #2893634) | Istoria paginii runda/eusebiu_oji_2006si2007_cls11-12 | Cod sursa (job #1845451)
#include<iostream>
#include<algorithm>
#include<fstream>
#include<vector>
using namespace std;
#define Nmax 1000000
ifstream in("dfs.in");
ofstream out("dfs.out");
int n,nrc;
vector <int> v(Nmax);
bool viz[Nmax+1];
void dfs(int x)
{
viz[x]=true;
for(int i=0;i<v[x].size();i++)
if(!viz[v[x][i]])
dfs(v[x][i]);
}
int main()
{
int m,i,x,y;
in>>n>>m;
for(i=0;i<m;i++)
{
in>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
for(int i=1;i<=n;i++)
if(!viz[i])
{
nrc++;
dfs(i);
}
out<<nrc;
}