1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
|
/**
* \brief Solve an instance of the "Variable Placement with Separation
* Constraints" problem.
*
* Authors:
* Tim Dwyer <tgdwyer@gmail.com>
*
* Copyright (C) 2005 Authors
*
* This version is released under the CPL (Common Public License) with
* the Graphviz distribution.
* A version is also available under the LGPL as part of the Adaptagrams
* project: https://github.com/mjwybrow/adaptagrams.
* If you make improvements or bug fixes to this code it would be much
* appreciated if you could also contribute those changes back to the
* Adaptagrams repository.
*/
#pragma once
#include <vector>
#include <vpsc/blocks.h>
struct Variable;
struct Constraint;
class Blocks;
/**
* Variable Placement with Separation Constraints problem instance
*/
struct VPSC {
public:
virtual void satisfy();
virtual void solve();
VPSC(const unsigned n, Variable *vs[], const unsigned m, Constraint *cs[]);
virtual ~VPSC() = default;
protected:
Blocks bs;
Constraint **cs;
unsigned m;
void printBlocks();
private:
void refine();
bool constraintGraphIsCyclic(const unsigned n, Variable *vs[]);
bool blockGraphIsCyclic();
};
struct IncVPSC : VPSC {
public:
unsigned splitCnt;
void satisfy();
void solve();
void moveBlocks();
void splitBlocks();
IncVPSC(const unsigned n, Variable *vs[], const unsigned m, Constraint *cs[]);
private:
typedef std::vector<Constraint*> ConstraintList;
ConstraintList inactive;
double mostViolated(ConstraintList &l,Constraint* &v);
};
|
