-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDendrogram.java
253 lines (183 loc) · 7.17 KB
/
Dendrogram.java
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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
package fr.kriszt.theo.GraphX;
import com.mxgraph.swing.mxGraphComponent;
import com.mxgraph.view.mxGraph;
import fr.kriszt.theo.relations.DendroLevel;
import fr.kriszt.theo.relations.Relation;
import fr.kriszt.theo.relations.ClassCluster;
import javax.swing.*;
import java.awt.*;
import java.util.*;
import java.util.List;
public class Dendrogram extends JFrame {
private static final int H_SPAN = 100;
private static final int V_SPAN = 100;
private static final int LINE_HEIGHT = 20;
private static final int LETTER_WIDTH = 6;
private mxGraph graph;
private Object parent;
private int GRAPH_WIDTH = 800;
private int GRAPH_HEIGHT = 600;
public Dendrogram(boolean testMode, boolean complet){
super("Arbre de couplage");
graph = new mxGraph();
parent = graph.getDefaultParent();
graph.getModel().beginUpdate();
if (testMode){
createTestModel(complet);
} else {
createModel();
}
createModel();
endInit();
}
@SuppressWarnings("Duplicates")
private void createModel() {
Set<String> classes = new HashSet<>();
for (Relation r : Relation.getAllRelations()){
// System.out.println(r);
classes.add(r.getInputType());
classes.add(r.getOutputType());
}
// System.out.println("Classes : " + classes);
Set<ClassCluster> baseClusters = new HashSet<>();
for (String c : classes){
baseClusters.add(new ClassCluster(Collections.singleton(c)));
}
// for (ClassCluster cc : baseClusters){
// System.out.println(cc);
// }
DendroLevel currentLevel = new DendroLevel(baseClusters);
DendroLevel baseLevel = currentLevel;
// System.out.println("Base : " + baseClusters);
//
ArrayList<DendroLevel> levels = new ArrayList<>();
//
while (currentLevel.genNextLevel()){
levels.add(currentLevel);
currentLevel = currentLevel.getParent();
}
//
// System.out.println("Levels :: " + levels);
renderLevels(levels);
}
@SuppressWarnings("Duplicates")
private void createTestModel(boolean complet) {
Set<String> classes = new HashSet<>();
classes.add("A");
classes.add("B");
classes.add("C");
classes.add("D");
Set<ClassCluster> baseClusters = new HashSet<>();
ClassCluster a = new ClassCluster(Collections.singleton("A"));
ClassCluster b = new ClassCluster(Collections.singleton("B"));
ClassCluster c = new ClassCluster(Collections.singleton("C"));
ClassCluster d = new ClassCluster(Collections.singleton("D"));
baseClusters.add(a);
baseClusters.add(b);
baseClusters.add(c);
baseClusters.add(d);
DendroLevel currentLevel = new DendroLevel(baseClusters);
ArrayList<DendroLevel> levels = new ArrayList<>();
// levels.add(currentLevel);
// System.out.println(currentLevel);
Set<Relation> relations = Relation.getAllRelations();
relations.clear();
if (complet){
relations.add(new Relation("A", "B", 5));
relations.add(new Relation("B", "C", 3));
relations.add(new Relation("C", "D", 4));
relations.add(new Relation("D", "A", 2));
} else {
relations.add(new Relation("A", "B", 5));
relations.add(new Relation("B", "C", 2));
relations.add(new Relation("C", "D", 4));
}
while (currentLevel.genNextLevel()){
levels.add(currentLevel);
// System.err.println("Ajout du level " + currentLevel);
currentLevel = currentLevel.getParent();
}
if (currentLevel != null){
levels.add(currentLevel);
}
//
// System.out.println("Levels trouvés :: " + levels);
renderLevels(levels);
}
private void renderLevels(List<DendroLevel> levels) {
Map<ClassCluster, Object> classesToVertices = new HashMap<>();
Set<ClassCluster> wantedParents = new HashSet<>();
int x = H_SPAN;
int y = V_SPAN;
for (DendroLevel dl : levels){
int levelNumber = levels.indexOf(dl);
// System.out.println("Rendu du level " + levelNumber);
int levelHeight = 0;
for (ClassCluster cc : dl.getClusters()){
levelHeight = Math.max(levelHeight, cc.getClasses().size());
String label = "S = " + cc.getCohesion() + "\n";
for (String s : cc.getClasses()){
label += s + "\n";
}
if (!classesToVertices.containsKey(cc) && (levelNumber == 0 || wantedParents.contains(cc))) {
// System.out.println("\tRendering cluster " + cc);
wantedParents.add(cc.getParent());
Object vertex = graph.insertVertex(parent, null, label, x, y, getVertexWidth(label), getVertexHeight(label));
classesToVertices.put(cc, vertex);
}
x += getVertexWidth(label) + H_SPAN;
}
x = H_SPAN;
y += levelHeight * LINE_HEIGHT + V_SPAN;
}
linkClusters(classesToVertices);
}
private void linkClusters(Map<ClassCluster, Object> classesToVertices) {
for (ClassCluster cc : classesToVertices.keySet()){
if (cc.getParent() != null){
Object from = classesToVertices.get(cc);
Object to = classesToVertices.get(cc.getParent());
graph.insertEdge(parent, null, "", from, to);
}
}
}
private int getVertexHeight(String label) {
return label.split("\\n").length * LINE_HEIGHT;
}
// private int countLabelLines(String label, int lineHeight) {
// int max = 0;
//
// for (String token : label.split("\\n")){
// max = Math.max(max, token.length());
// }
//
// return max * lineHeight;
// }
private int getVertexWidth(String label) {
int max = 0;
for (String token : label.split("\\n")){
max = Math.max(max, token.length());
}
return max * LETTER_WIDTH;
}
@SuppressWarnings("Duplicates")
private void endInit() {
graph.setAllowDanglingEdges(false);
graph.setEdgeLabelsMovable(true);
graph.setConnectableEdges(false);
graph.setCellsDeletable(false);
graph.setCellsCloneable(false);
graph.setCellsDisconnectable(false);
graph.setDropEnabled(false);
graph.setSplitEnabled(false);
graph.setDisconnectOnMove(false);
graph.setCellsBendable(true);
graph.getModel().endUpdate();
mxGraphComponent graphComponent = new mxGraphComponent(graph);
graphComponent.setPreferredSize(new Dimension(GRAPH_WIDTH, GRAPH_HEIGHT));
getContentPane().add(graphComponent);
pack();
setDefaultCloseOperation(EXIT_ON_CLOSE);
setVisible(true);
}
}