-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathensemble.c
56 lines (51 loc) · 1.05 KB
/
ensemble.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
#include "ensemble.h"
#include <stdlib.h>
set_t* creerEnsembleVide(void)
{
set_t *a = (set_t*) malloc(sizeof(set_t));
a->queue = a->tete = NULL;
a->size = 0;
return a;
}
set_t* creerEnsemble(cell_ensemble_t *sommet)
{
set_t *a = (set_t*) malloc(sizeof(set_t));
a->tete = a->queue = NULL;
a->queue = a->tete = sommet;
a->tete->representant = a;
a->size = 1;
return a;
}
set_t* trouverEnsemble(cell_ensemble_t *x)
{
return x->representant;
}
/**
* Application avec l'heuristique de l'union pondérée
* pour un temps d'exécution plus faible.
*/
void union_ensemble(cell_ensemble_t *x, cell_ensemble_t *y)
{
set_t *a = x->representant, *b = y->representant;
cell_ensemble_t *cell = NULL;
if (b->size <= a->size)
{
a->size += b->size;
a->queue->succ = b->tete;
a->queue = b->queue;
for (cell = b->tete; cell != NULL; cell = cell->succ)
{
cell->representant = a;
}
}
else
{
b->size += a->size;
b->queue->succ = a->tete;
b->queue = a->queue;
for (cell = a->tete; cell != NULL; cell = cell->succ)
{
cell->representant = b;
}
}
}