/* See {Heuristic.h} */ #include #include #include void DisplaceNode(Place_t @p, Coords_t *c, bool_vec_t *variable, ElemTableRec_t *top, /* UNUSED */ coins : rand_t; ) { Node_t u = OrgV(a); ??? un = u->num; ??? star = Triangulation.Neighbors(a,top); ??? bar = Triangulation.NeighborBarycenter(star,c); ??? bar0 = bar[0]; ??? bar1 = bar[1]; ??? bar2 = bar[2]; ??? bar3 = bar[3]; { if ((variable[un]) && (u->exists )){ ??? cun = c[un]; { cun[0] = bar0; cun[1] = bar1; cun[2] = bar2; cun[3] = bar3; } } } } /* END DisplaceNode */ { } Heuristic.