Pagini recente » Istoria paginii runda/wellcodesimulareclasa10-4martie | Cod sursa (job #2209240) | Cod sursa (job #2819502) | Cod sursa (job #3134625) | Cod sursa (job #2259687)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
vector <int> Muchii[100000];
bool vizitat[100000];
unsigned int insule=0;
int n,m;
void DFS( int nod ){
unsigned i;
vizitat[nod]=true;
for(i=0;i<Muchii[nod].size();i++){
int vecin=Muchii[nod][i];
if(!vizitat[vecin]){
DFS(vecin);
}
}
}
void Citire(){
int i;
fin>>n>>m;
for(i=1;i<=m;i++){
int x,y;
fin>>x>>y;
Muchii[x].push_back(y);
Muchii[y].push_back(x);
}
for(i=1;i<=n;i++){
if(!vizitat[i]){
insule++;
DFS(i);
}
}
}
int main()
{
Citire();
fout<<insule;
return 0;
}