contiguous so we move point positions to improve contiguity */
if (graph && improve_contiguity_n) {
for (i = 0; i < improve_contiguity_n; i++){
- improve_contiguity(n, dim, grouping, poly_point_map, x, graph, width);
+ improve_contiguity(n, dim, grouping, poly_point_map, x, graph);
nart = nart0;
nrandom = nr0;
make_map_from_rectangle_groups(exclude_random, pm->include_OK_points,
return point_poly_map->ja[point_poly_map->ia[ip]];
}
-void improve_contiguity(int n, int dim, int *grouping, SparseMatrix poly_point_map, real *x, SparseMatrix graph, real *label_sizes){
+void improve_contiguity(int n, int dim, int *grouping, SparseMatrix poly_point_map, real *x, SparseMatrix graph){
/*
grouping: which group each of the vertex belongs to
poly_point_map: a matrix of dimension npolys x (n + nrandom), poly_point_map[i,j] != 0 if polygon i contains the point j.
SparseMatrix *country_graph, int *flag);
-void improve_contiguity(int n, int dim, int *grouping, SparseMatrix poly_point_map, real *x, SparseMatrix graph, real *label_sizes);
+void improve_contiguity(int n, int dim, int *grouping, SparseMatrix poly_point_map, real *x, SparseMatrix graph);
#if 0