Pagini recente » Cod sursa (job #1132962) | Cod sursa (job #2160401) | Cod sursa (job #605904) | Cod sursa (job #2581662) | Cod sursa (job #2138610)
#include <bits/stdc++.h>
using namespace std;
vector<int> V[100];
bool viz[100];
int n,m,x,y,k;
void dfs(int p){
viz[p] = 1;
//fout << p << " ";
for (int i=0; i<V[p].size(); i++){ //important sa incepem de la 0
if (!viz[V[p][i]]) dfs(V[p][i]);
}
}
int main()
{
ifstream fin("dfs.in");
ofstream fout("dfs.out");
fin >> n >> m;
for (int i=1; i<=m; i++){
fin >> x >> y;
V[y].push_back(x);
V[x].push_back(y);
}
for (int i=1; i<=n; i++){
if (!viz[i])
dfs(i), k++;
}
fout << k;
return 0;
}