Pagini recente » Cod sursa (job #1700702) | Cod sursa (job #802624) | Cod sursa (job #2268031) | Cod sursa (job #2312328) | Cod sursa (job #2209383)
#include <fstream>
#include <vector>
using namespace std;
ifstream in("dfs.in");
ofstream out("dfs.out");
int n, m, nod1, nod2, componenteConexe;
bool checked[100001];
vector <int> v[100001];
void dfs(int nod)
{
checked[nod]=true;
for(register int i=0; i<v[nod].size(); ++i)
if( checked[v[nod][i]] == false )
dfs(v[nod][i]);
}
int main()
{
in>>n>>m;
for(register int i=1; i<=m; ++i)
{
in>>nod1>>nod2;
v[nod1].push_back(nod2);
v[nod2].push_back(nod1);
}
for(register int i=1; i<=n; ++i)
if( checked[i] == false )
{
dfs(i);
componenteConexe++;
}
out<<componenteConexe;
return 0;
}