This struct was used as a node in a doubly-linked list. But the back pointers
were never used. This commit simplifies it into a singly-linked-list.
grid->R0 = NULL;
grid->R = NULL;
grid->next = NULL;
- grid->prev = NULL;
grid->inks = (double*)MALLOC(sizeof(double)*(A->m));
grid->edges = edges;
grid->delete_top_level_A = 0;
cgrid = Agglomerative_Ink_Bundling_establish(cgrid, pick, angle_param, angle);
grid->next = cgrid;
- cgrid->prev = grid;
} else {
if (Verbose > 1) fprintf(stderr,"no more improvement, orig ink = %f, gain = %f, stop and final bundling found\n", grand_total_ink, grand_total_gain);
the nodes on the finest grid corresponding to the coarsest node 1, etc */
SparseMatrix R;/* striction mtrix from level to level + 1*/
Agglomerative_Ink_Bundling next;
- Agglomerative_Ink_Bundling prev;
double *inks; /* amount of ink needed to draw this edge/bundle. Dimension n. */
double total_ink; /* amount of ink needed to draw this edge/bundle. Dimension n. */
pedge* edges; /* the original edge info. This does not vary level to level and is of dimenion n0, where n0 is the number of original edges */