}
return l;
}
-void delete_digcola_levels(DigColaLevel * l, int num_levels)
-{
- int i;
- for (i = 0; i < num_levels; i++) {
- free(l[i].nodes);
- }
- free(l);
-}
/*********************
get number of separation constraints based on the number of nodes in each level
* unpack the "ordering" array into an array of DigColaLevel (as defined above)
*/
extern DigColaLevel* assign_digcola_levels(int *ordering, int n, int *level_inds, int num_divisions);
-extern void delete_digcola_levels(DigColaLevel *l, int num_levels);
int get_num_digcola_constraints(DigColaLevel *levels, int num_levels);
#endif