Pagini recente » Cod sursa (job #800187) | Cod sursa (job #2126333) | Monitorul de evaluare | Cod sursa (job #1803222) | Cod sursa (job #2377900)
#include <iostream>
#include <vector>
#include <fstream>
std::ifstream fin("dfs.in");
std::ofstream fout("dfs.out");
std::vector <int> graf[100010];
int viz[100010];
void dfs(int node)
{
viz[node]=1;
for(int i=0;i< graf[node].size();i++)
{
if( ! viz[graf[node][i]])
dfs(graf[node][i]);
}
}
int main()
{
int x,y,noduri,muchii,nr=0;
fin>>noduri>>muchii;
for(int i=0;i<muchii;i++)
{
fin>>x>>y;
graf[x].push_back(y);
graf[y].push_back(x);
}
for(int i=0;i<noduri;i++)
{
if(!viz[i])
nr+=1;
dfs(i);
}
fout<<nr;
}