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
|
/**
*
* This file is part of Tulip (www.tulip-software.org)
*
* Authors: David Auber and the Tulip development Team
* from LaBRI, University of Bordeaux
*
* Tulip 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 3
* of the License, or (at your option) any later version.
*
* Tulip 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.
* See the GNU General Public License for more details.
*
*/
#include "HierarchicalClustering.h"
using namespace std;
using namespace tlp;
PLUGIN(HierarchicalClustering)
//================================================================================
HierarchicalClustering::HierarchicalClustering(PluginContext* context):Algorithm(context) {
}
//================================================================================
HierarchicalClustering::~HierarchicalClustering() {
}
//================================================================================
class LessThan {
public:
DoubleProperty *metric;
bool operator() (node n1,node n2) {
return (metric->getNodeValue(n1) < metric->getNodeValue(n2));
}
};
bool HierarchicalClustering::split(DoubleProperty *metric,list<node> &orderedNode) {
Iterator<node> *itN=graph->getNodes();
for (; itN->hasNext();)
orderedNode.push_back(itN->next());
delete itN;
LessThan comp;
comp.metric=metric;
orderedNode.sort(comp);
list<node>::iterator itListNode;
double tmpDbl;
//We split the sorted list in two part
int nbElement=orderedNode.size();
nbElement/=2;
if (nbElement<10) return (true);
itListNode=orderedNode.begin();
tmpDbl=metric->getNodeValue(*itListNode);
int n=0;
++itListNode;
nbElement--;
while ((itListNode!=orderedNode.end()) && ((nbElement>0) || (tmpDbl==metric->getNodeValue(*itListNode))) ) {
tmpDbl=metric->getNodeValue(*itListNode);
++itListNode;
n++;
nbElement--;
}
orderedNode.erase(itListNode,orderedNode.end());
return false;
}
//================================================================================
bool HierarchicalClustering::run() {
string tmp1,tmp2;
DoubleProperty *metric=graph->getProperty<DoubleProperty>("viewMetric");
tmp1="Hierar Sup";
tmp2="Hierar Inf";
bool result=false;
while (!result) {
list<node> badNodeList;
result = split(metric,badNodeList);
if (!result) {
BooleanProperty sel1(graph);
BooleanProperty sel2(graph);
BooleanProperty splitRes(graph);
sel1.setAllNodeValue(true);
sel1.setAllEdgeValue(true);
sel2.setAllNodeValue(true);
sel2.setAllEdgeValue(true);
splitRes.setAllNodeValue(true);
splitRes.setAllEdgeValue(true);
list<node>::iterator itl;
for (itl=badNodeList.begin(); itl!=badNodeList.end(); ++itl)
splitRes.setNodeValue(*itl, false);
Iterator<node> *itN=graph->getNodes();
for (; itN->hasNext();) {
node nit=itN->next();
if (splitRes.getNodeValue(nit)) {
sel2.setNodeValue(nit, false);
Iterator<edge> *itE=graph->getInOutEdges(nit);
for (; itE->hasNext();) {
edge ite=itE->next();
sel2.setEdgeValue(ite, false);
}
delete itE;
}
else {
sel1.setNodeValue(nit,false);
Iterator<edge> *itE=graph->getInOutEdges(nit);
for (; itE->hasNext();) {
edge ite=itE->next();
sel1.setEdgeValue(ite, false);
}
delete itE;
}
}
delete itN;
Graph * tmpSubGraph;
tmpSubGraph = graph->addSubGraph(&sel1);
tmpSubGraph->setAttribute<string>("name",tmp1);
(graph->addSubGraph(&sel2))->setAttribute<string>("name",tmp2);
graph=tmpSubGraph;
}
}
return true;
}
|
