Pagini recente » Cod sursa (job #1230020) | Cod sursa (job #3229701) | Cod sursa (job #1586275) | Cod sursa (job #295204) | Cod sursa (job #2501959)
#include <fstream>
using namespace std;
ifstream in("dfs.in");
ofstream out("dfs.out");
const int N=100001;
const int M=2*N;
int lst[N],vf[2*M],urm[2*M],n,nr,viz[2*M],m,x,y;
void adaugare(int x,int y){
vf[++nr]=y;
urm[nr]=lst[x];
lst[x]=nr;
}
void dfs(int x){
viz[x]=true;
for(int p=lst[x];p!=0;p=urm[p]){
int y=vf[p];
if(!viz[y])
dfs(y);
}
}
int main()
{
in>>n>>m;
for(int i=1;i<=m;i++){
in>>x>>y;
adaugare(x,y);
adaugare(y,x);
}
int cnt = 0;
for(int i=1; i<=n; i++)
if(!viz[i]){
cnt++;
dfs(i);
}
out<<cnt;
return 0;
}