Pagini recente » Cod sursa (job #305134) | Cod sursa (job #3186098) | Cod sursa (job #1134452) | Cod sursa (job #1757902) | Cod sursa (job #2551272)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("dfs.in");
ofstream of("dfs.out");
vector< vector<int> > lista_adc;
vector<bool> viz;
int n;
void dfs(int start){
viz[start] = 1;
for(int j = 0; j < lista_adc[start].size(); j++)
if( !viz[ lista_adc[start][j] ] )
dfs( lista_adc[start][j] );
}
int main()
{
int i, j, k, m, cnt = 0;
f >> n >> m;
lista_adc.assign( n + 1, vector<int>() );
viz.assign( n + 1, 0 );
for(k = 0; k < m; k++) {
f >> i >> j;
lista_adc[i].push_back( j );
lista_adc[j].push_back( i );
}
for(i = 1; i <= n; i++)
if( !viz[i] ) {
cnt++;
dfs(i);
}
of << cnt;
return 0;
}