Pagini recente » Cod sursa (job #191233) | Cod sursa (job #161215) | Cod sursa (job #214693) | Cod sursa (job #217877) | Cod sursa (job #2967285)
#include <fstream>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int n, m;
bool viz[100001], a[100001][100001];
void Citire()
{
int i, x, y;
fin >> n >> m;
for (i = 1; i <= m; i++)
{
fin >> x >> y;
a[x][y] = a[y][x] = 1;
}
}
void DFS(int k)
{
viz[k] = 1;
for (int i = 1; i <= n; i++)
if (!viz[i] && a[k][i])
DFS(i);
}
void NrCompCon()
{
int i, contor = 0;
for (i = 1; i <= n; i++)
if (!viz[i])
{
contor++;
DFS(i);
}
fout << contor << "\n";
}
int main()
{
Citire();
NrCompCon();
return 0 ;
}