-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathtest_dbscan_1.c
127 lines (102 loc) · 4.18 KB
/
test_dbscan_1.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
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
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <time.h>
#include <string.h>
#include "quadtree.h"
#include "bitvec.h"
#include "dbscan.h"
int main(int argc, char **argv) {
bitvec_t *neighbours;
unsigned int c;
QUADTREE *ref = NULL;
bitvec_alloc(&neighbours, 8);
unsigned int clusters[4];
unsigned int expected_clusters1[] = {1, 1, 0, 0};
unsigned int expected_clusters2[] = {1, 1, 1, 0};
unsigned int expected_clusters3[] = {0, 0, 0, 0};
unsigned int expected_clusters4[] = {1, 1, 1, 0};
assert(!quadtree_init(&ref, 7, 7));
// x is the document, y is the label
assert(quadtree_insert(ref, 0, 4));
assert(quadtree_insert(ref, 1, 4));
assert(quadtree_insert(ref, 2, 3));
assert(quadtree_insert(ref, 2, 4));
assert(quadtree_insert(ref, 3, 1));
// Test the initial set algorithm
assert(!neighbours_determine_initial_set(neighbours, ref, 0, &c));
assert(c == 3);
assert(bitvec_check(neighbours, 0));
assert(bitvec_check(neighbours, 1));
assert(bitvec_check(neighbours, 2));
c = 0; bitvec_clear_all(neighbours);
assert(!neighbours_determine_initial_set(neighbours, ref, 1, &c));
assert(c == 3);
assert(bitvec_check(neighbours, 0));
assert(bitvec_check(neighbours, 1));
assert(bitvec_check(neighbours, 2));
c = 0; bitvec_clear_all(neighbours);
assert(!neighbours_determine_initial_set(neighbours, ref, 2, &c));
assert(c == 3);
assert(bitvec_check(neighbours, 0));
assert(bitvec_check(neighbours, 1));
assert(bitvec_check(neighbours, 2));
c = 0; bitvec_clear_all(neighbours);
assert(!neighbours_determine_initial_set(neighbours, ref, 3, &c));
assert(c == 1);
assert(bitvec_check(neighbours, 3));
// Test the neighbour generation algorithm
c = 0; bitvec_clear_all(neighbours);
assert(!neighbours_search(neighbours, ref, 0, 0.005f, &c));
assert(c == 2);
assert(bitvec_check(neighbours, 0));
assert(bitvec_check(neighbours, 1));
c = 0; bitvec_clear_all(neighbours);
assert(!neighbours_search(neighbours, ref, 1, 0.005f, &c));
assert(c == 2);
assert(bitvec_check(neighbours, 0));
assert(bitvec_check(neighbours, 1));
c = 0; bitvec_clear_all(neighbours);
assert(!neighbours_search(neighbours, ref, 2, 0.005f, &c));
assert(c == 1);
assert(bitvec_check(neighbours, 2));
c = 0; bitvec_clear_all(neighbours);
assert(!neighbours_search(neighbours, ref, 3, 0.005f, &c));
assert(c == 1);
assert(bitvec_check(neighbours, 3));
c = 0; bitvec_clear_all(neighbours);
assert(!neighbours_search(neighbours, ref, 0, 0.5f, &c));
assert(c == 3);
assert(bitvec_check(neighbours, 0));
assert(bitvec_check(neighbours, 1));
assert(bitvec_check(neighbours, 2));
c = 0; bitvec_clear_all(neighbours);
assert(!neighbours_search(neighbours, ref, 1, 0.5f, &c));
assert(c == 3);
assert(bitvec_check(neighbours, 0));
assert(bitvec_check(neighbours, 1));
assert(bitvec_check(neighbours, 2));
c = 0; bitvec_clear_all(neighbours);
assert(!neighbours_search(neighbours, ref, 2, 0.5f, &c));
assert(c == 3);
assert(bitvec_check(neighbours, 0));
assert(bitvec_check(neighbours, 1));
assert(bitvec_check(neighbours, 2));
c = 0; bitvec_clear_all(neighbours);
assert(!neighbours_search(neighbours, ref, 3, 0.5f, &c));
assert(c == 1);
assert(bitvec_check(neighbours, 3));
for (int i = 0; i < 4; i++) clusters[i] = i;
assert(!DBSCAN(ref, clusters, 4, 0.005f, 2, &neighbours_search));
assert(!memcmp(clusters, expected_clusters1, sizeof(unsigned int) * 4));
for (int i = 0; i < 4; i++) clusters[i] = i;
assert(!DBSCAN(ref, clusters, 4, 0.5, 2, &neighbours_search));
assert(!memcmp(clusters, expected_clusters2, sizeof(unsigned int) * 4));
for (int i = 0; i < 4; i++) clusters[i] = i;
assert(!DBSCAN(ref, clusters, 4, 0.005f, 3, &neighbours_search));
assert(!memcmp(clusters, expected_clusters3, sizeof(unsigned int) * 4));
for (int i = 0; i < 4; i++) clusters[i] = i;
assert(!DBSCAN(ref, clusters, 4, 0.5f, 3, &neighbours_search));
assert(!memcmp(clusters, expected_clusters4, sizeof(unsigned int) * 4));
return 0;
}