Pagini recente » Cod sursa (job #1647377) | Cod sursa (job #2399906) | Cod sursa (job #2185270) | Cod sursa (job #1955353) | Cod sursa (job #2135915)
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
const int N = 100001;
int n, m;
vector <int> a[N];
bool viz[N];
void dfs(int x)
{
viz[x] = true;
int y, i;
for(i = 0; i < a[x].size(); i++)
{
y = a[x][i];
if(!viz[y]) dfs(y);
}
}
void read()
{
fin >> n >> m;
int i, x, y;
for(i = 0; i < m; i++)
{
fin >> x >> y;
a[x].push_back(y);
a[y].push_back(x);
}
}
int main() {
read();
int i, nr_conex = 0;
for(i = 1; i <= n; i++)
{
if(!viz[i]){
dfs(i);
++nr_conex;
}
}
fout << nr_conex;
fin.close();
return 0;
}