Newer
Older
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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
#include "GainBucket.h"
int main(int argc, char **argv) {
void CheckBuckets2(struct gainbucket GB, long n, long bs);
long n, bs, i, j, newkey;
struct gainbucket GB ;
struct bucket *pB ;
struct bucketentry *pE ;
printf("Test BucketMove: ");
n= 100 ; /* number of buckets */
bs = 5; /* bucket size */
/* Insert vertices in increasing order of gain value */
GB.NrBuckets =0 ;
GB.Root = NULL ;
for (j=0; j<bs; j++)
for (i=0; i<n; i++)
BucketInsert(&GB, i, j*n + i) ;
/* Move vertices to new buckets -1, -2, ... -n, while reversing the order
inside the buckets. These buckets are created at the end of the
current bucket list */
pB = GB.Root ;
while ( pB != NULL && pB->value >= 0 ) {
pE = pB->entry ; /* all buckets are nonempty */
newkey = pB->value - n ;
BucketMove(&GB, pE, newkey) ;
pB = GB.Root ;
}
CheckBuckets2(GB, n, bs) ;
printf("OK\n") ;
exit(0);
} /* end main */
void CheckBuckets2(struct gainbucket GB, long n, long bs) {
long nrentries = 0, i, j ;
struct bucket *pB ;
struct bucketentry *pE ;
if (GB.NrBuckets != n){
printf("Error\n") ;
exit(1);
}
pB = GB.Root ;
i = 0;
while ( pB != NULL ) {
j = 0;
pE = pB->entry ;
while ( pE != NULL ) {
if ( (pE->bucket)->value != -1-i /* = n-1-i - n */
|| pE->vtxnr != n-1-i + j*n ) {
printf("Error\n") ;
exit(1);
}
nrentries++ ;
j++ ;
pE = pE->next ;
}
pB = pB->next ;
if (j!= bs){
printf("Error\n") ;
exit(1);
}
i++ ;
}
if (nrentries != n*bs){
printf("Error\n") ;
exit(1);
}
} /* end CheckBuckets2 */