Cod sursa(job #1192368)

Utilizator PaueyPaula Nicoleta Gradu Pauey Data 28 mai 2014 21:31:34
Problema Parcurgere DFS - componente conexe Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.62 kb
#include <fstream>
using namespace std;

bool viz[100001];
int vec[10001][10001];

int n, m, a, b, nr;

void DFS(int G) {
   viz[G] = 1;
   for(int i = 1; i <= vec[G][0]; ++i)
      if(!viz[vec[G][i]])
         DFS(vec[G][i]);
}

int main()
{
    ifstream in("dfs.in");
    ofstream out("dfs.out");
    in >> n >> m;
    for(int i = 1; i <= m; ++i) {
      in >> a >> b;
      ++vec[a][0];
      vec[a][vec[a][0]] = b;
      ++vec[b][0];
      vec[b][vec[b][0]] = a;
    }
    for(int i = 1; i <= n; ++i){
      if(!viz[i]) {
         ++nr;
         DFS(i);
      }
    }
    out << nr;
    return 0;
}