-
Notifications
You must be signed in to change notification settings - Fork 2
/
cluster.c
185 lines (172 loc) · 4.44 KB
/
cluster.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
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
// ----------------------------------------------------------------//
// Filename : cluster.c
// try to cluster some near sink nodes
//
// Author : Xiao Zigang
// Modifed: < Thu Mar 5 14:42:55 HKT 2009 >
// ----------------------------------------------------------------//
// Useage:
// Use (preprocess_block) and (preprocess_sinks) first
// and (construct_g_all)
// then use (cluster_sink)s to generate polylines
// Use (link_info[i]) to access the link, (link_num) is the total number
// where (link_list) is the parent pointer (from tail to head)
// At last should call (free_clusters) to free resources
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "util.h"
#include "ds.h"
#include "cluster.h"
#include "connect.h"
#include "bufplace.h"
int * link_list=NULL;
BOOL * isHead=NULL;
BOOL * isTail=NULL;
LINK_INFO* link_info=NULL;
int link_num=0;
// REQUIRE: all pair shortest path has been computed
// if not, calculate it first
// We need a data structure to store the list
void cluster_sinks(BLOCKAGE * blockage,SINK * sink){
if( dirty )
report_exit("You must calculate all pair shortest path first!");
allocate_init_clusters(sink);
int i,j;
int head,tail;
int length = 0;
int cap = 0;
int num = 0;
BOOL * used = (BOOL*) malloc(sink->num * sizeof(BOOL));
memset(used,FALSE,sizeof(sink->num * sizeof(int)));
for(i=0;i<sink->num;i++){
// for each sink, try to form a poly line GREEDILY
// note that in g, sink node starts from static_num
if(used[i]) continue;
used[i]=TRUE;
head = tail = i;
length = 0;
cap = sink->pool[i].lc;
num=1;
do{
int min_dist = INFINITE;
int min_idx = -1;
char which = 'h';// h=head, t=tail
int s,t;
// find a nearest neighbour in head side
for(j=0;j<sink_num;j++){
s=head+static_num;
t=j+static_num;
if( !used[j] && head!=j &&
pairs[s][t] < min_dist ){
min_dist = pairs[s][t];
min_idx = j;
which = 'h';
}
}
// find a nearest neighbour in tail side
for(j=0;j<sink_num;j++){
s=tail+static_num;
t=j+static_num;
if( !used[j] && tail!=j &&
pairs[s][t] < min_dist ) {
min_dist = pairs[s][t];
min_idx = j;
which = 't';
}
}
// check if adding the selected node violates
int new_len,new_cap;
if( min_idx != -1 ){
new_len = length+min_dist;
new_cap = (cap + sink->pool[min_idx].lc);
}
if( min_idx != -1 &&
new_len <= MAX_LEN &&
new_cap <= MAX_CAP &&
num +1 <= MAX_SINK ){
// update length cap num
length = new_len;
cap = new_cap;
num++;
used[min_idx] = TRUE;
}
else{ // finish this polyline
link_info[link_num].l = length;
link_info[link_num].c = cap;
link_info[link_num].n = num;
link_info[link_num].t = tail;
link_info[link_num].h = head;
link_num++;
break;
}
// now EXPAND(update head/tail and pointer)
switch( which ){
case 'h':
link_list[head] = min_idx;
isHead[head] = FALSE;
isTail[min_idx] = FALSE;
isHead[min_idx] = TRUE;
head = min_idx;
break;
case 't':
link_list[min_idx] = tail;
isTail[tail] = FALSE;
isTail[min_idx] = TRUE;
isHead[min_idx] = FALSE;
tail = min_idx;
break;
}
}while(1);
}
free(used);
return;
}
void allocate_init_clusters(SINK * sink){
int i;
link_list = (int*) malloc(sink->num * sizeof(int));
isHead = (int*) malloc(sink->num * sizeof(int));
isTail = (int*) malloc(sink->num * sizeof(int));
link_info = (LINK_INFO*) malloc(sink->num * sizeof(LINK_INFO));
for(i=0;i<(sink->num);i++){
link_list[i] = -1;
isHead[i] = TRUE;
isTail[i] = TRUE;
}
}
void free_clusters(){
free(link_list);
free(isHead);
free(isTail);
free(link_info);
link_list=NULL;
isHead=isTail=NULL;
link_info=NULL;
}
void store_sinks(SINK * sink,SINK * linked_sink){
int i;
/*
for(i=0;i<sink->num;i++){
printf("%d %d %d\n",i, sink->pool[i].x, sink->pool[i].y);
}
*/
SNODE * ns = (SNODE*) malloc(sizeof(SNODE)*sink->num);
int count=0;
for(i=0;i<link_num;i++){
int p = link_info[i].t;
ns[count] = sink->pool[p];
ns[count].lc = link_info[i].c;
//printf("%d %d %d\n",count, ns[count].x, ns[count].y);
count++;
}
linked_sink->pool = (SNODE*) malloc(sizeof(SNODE)*sink->num);
memcpy(linked_sink->pool,sink->pool,sizeof(SNODE)*sink->num);
linked_sink->num = sink->num;
memcpy(sink->pool,ns,sizeof(SNODE)*sink->num);
sink->num = count;
/*
for(i=0;i<sink->num;i++){
printf("%d %d %d\n",i, sink->pool[i].x, sink->pool[i].y);
}
*/
}