Pagini recente » Cod sursa (job #3314274) | Cod sursa (job #3322500) | Cod sursa (job #3329349) | Cod sursa (job #1070608) | Cod sursa (job #2387520)
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
vector <int> muchii[10];
bool viz[10];
void dfs(int s)
{
viz[s] = true;
for(int i = 0; i < muchii[s].size(); ++i)
{
if(viz[muchii[s][i]] == false)
dfs(muchii[s][i]);
}
}
void initialize()
{
for(int i = 0; i < 10; ++i)
viz[i] = false;
}
int main()
{
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int noduri, numarMuchii, x, y, componenteConexe = 0;
fin>>noduri>>numarMuchii;
for(int i = 0; i < numarMuchii; ++i)
{
fin >> x >> y;
muchii[x].push_back(y);
muchii[y].push_back(x);
}
fin.close();
initialize();
for(int i = 1; i <= noduri; ++i)
{
if(viz[i] == false)
{
dfs(i);
componenteConexe++;
}
}
fout<<componenteConexe;
fout.close();
return 0;
}