Pagini recente » Cod sursa (job #2965885) | Cod sursa (job #1143041) | Cod sursa (job #396336) | Cod sursa (job #395350) | Cod sursa (job #2516504)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f ("dfs.in");
ofstream g ("dfs.out");
const int Max=100005;
vector < int > muchii[Max];
int noduri,NrMuchii;
bool nodVizitate[Max];
void fagocitare ( int x )
{
unsigned int i;
nodVizitate[x]=1;
for(i=0;i<muchii[x].size();i++)
{
int y;
y=muchii[x][i];
if(!nodVizitate[y])
fagocitare(y);
}
}
int nrIsles ()
{
int i,insule=0;
for(i=1;i<=noduri;i++)
if(!nodVizitate[i])
{
insule++;
fagocitare(i);
}
return insule;
}
void Read ()
{
int i;
f>>noduri>>NrMuchii;
for( i=1; i <= NrMuchii; i++ )
{
int x, y;
f>>x>>y;
muchii[x].push_back(y); // goes forth
muchii[y].push_back(x); // and back
}
}
int main()
{
Read();
g<<nrIsles()<<'\n';
return 0;
}