106 int nbLabelledLayers;
111 char **labelledLayersName;
143 double *labelPositionCost;
155 double *inactiveCost;
170 void solution_cost();
171 void check_solution();
193 void post_optimization();
206 std::list<LabelPosition*> * getSolution(
bool returnInactive );
213 SubPart *subPart(
int r,
int featseed,
int *isIn );
215 void initialization();
217 double compute_feature_cost(
SubPart *part,
int feat_id,
int label_id,
int *nbOverlap );
218 double compute_subsolution_cost(
SubPart *part,
int *s,
int * nbOverlap );
220 double popmusic_chain(
SubPart *part );
222 double popmusic_tabu(
SubPart *part );
223 double popmusic_tabu_chain(
SubPart *part );
225 void init_sol_empty();
226 void init_sol_falp();
231 void drawLabels( std::ofstream &svgmap );
int getFeatureCandidateCount(int i)
int probSize
of features in problem
void seed(uint32_t value)
struct pal::_subpart SubPart
int * sub
wrap bw sub feat and main feat
int subSize
total # features (prob + border)
LabelPosition is a candidate feature label position.
LabelPosition * getFeatureCandidate(int fi, int ci)
int borderSize
of features bounding the problem
int seed
first feat in sub part