blob: 5fbe75ebab52b7cb63e8fea80a0c5032956098cf (
plain)
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
|
/*
* vim: ts=4 sw=4 et tw=0 wm=0
*
* libcola - A library providing force-directed network layout using the
* stress-majorization method subject to separation constraints.
*
* Copyright (C) 2010 Monash University
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
* See the file LICENSE.LGPL distributed with the library.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
*
* Author(s): Michael Wybrow
*
*/
#ifndef COLA_CC_CLUSTERCONTAINMENTCONSTRAINTS_H
#define COLA_CC_CLUSTERCONTAINMENTCONSTRAINTS_H
#include <vector>
#include "libcola/compound_constraints.h"
namespace vpsc {
class Rectangle;
}
namespace cola {
class ClusterContainmentConstraints : public CompoundConstraint
{
public:
ClusterContainmentConstraints(Cluster *cluster, unsigned int priority,
std::vector<vpsc::Rectangle*>& boundingBoxes);
SubConstraintAlternatives getCurrSubConstraintAlternatives(
vpsc::Variables vs[]);
void generateVariables(const vpsc::Dim dim, vpsc::Variables& vars);
void generateSeparationConstraints(const vpsc::Dim dim,
vpsc::Variables& vars, vpsc::Constraints& cs,
std::vector<vpsc::Rectangle*>& bbs);
std::string toString(void) const;
};
} // namespace cola
#endif // COLA_CC_CLUSTERCONTAINMENTCONSTRAINTS
|
