Pagini recente » Cod sursa (job #489322) | La capatul lumii | Cod sursa (job #616110) | Cod sursa (job #1078413) | Cod sursa (job #1026348)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
vector<int> V[100001];//listele de adiacenta
int n,m;//noduri/muchii
int p[100001];//vizitat/nevizitat
void citire()
{
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);
}
}
void DF(int k)
{
p[k]=1;
for(int i=0;i<V[k].size();i++)
if(!p[V[k][i]])
DF(V[k][i]);
}
int main()
{
citire();
int k=0;
for(int i=1;i<=n;i++)
if(!p[i])
{
k++;
DF(i);
}
fout<<k;
fin.close();
fout.close();
return 0;
}