Cod sursa(job #566709)

Utilizator sebii_cSebastian Claici sebii_c Data 29 martie 2011 11:03:12
Problema Parcurgere DFS - componente conexe Scor 100
Compilator c Status done
Runda Arhiva educationala Marime 1.26 kb
#include <stdio.h>
#include <stdlib.h>
#define NMAX 100005
#define FIN "dfs.in"
#define FOUT "dfs.out"

enum colors {WHITE, GRAY, BLACK};

void read();
void DFS();
void DFS_Visit(int u);

int *A[NMAX], color[NMAX];
int m, n, count;

void read()
{
     int x, y, i; 
     scanf("%d %d", &n, &m);
     for (i=1; i<=n; ++i) {
         A[i] = (int*)malloc(sizeof(int));
         A[i][0] = 0;
     }
     for (i=1; i<=m; ++i) {
         scanf("%d %d", &x, &y);
         ++A[x][0];
         A[x] = realloc(A[x], (A[x][0]+1)*sizeof(int));
         A[x][A[x][0]] = y;
         ++A[y][0];
         A[y] = realloc(A[y], (A[y][0]+1)*sizeof(int));
         A[y][A[y][0]] = x;
     }
}

void DFS()
{
     int i;
     for (i=1; i<=n; i++) {
         color[i] = WHITE;
     }
     for (i=1; i<=n; ++i)
         if (color[i] == WHITE) {
            ++count;
            DFS_Visit(i);
         }
}

void DFS_Visit(int u)
{
     int i;
     color[u] = GRAY;
     for (i=1; i<=A[u][0]; ++i)
         if (color[A[u][i]] == WHITE) 
                            DFS_Visit(A[u][i]);
     color[u] = BLACK;
}

int main()
{
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
    read();
    DFS();
    printf("%d", count);
    return 0;
}