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
|
/**
*
* 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 <algorithm>
#include "TulipNodeMetricSorter.h"
#include <tulip/DoubleProperty.h>
#include <tulip/IntegerProperty.h>
using namespace std;
using namespace tlp;
namespace pocore {
map<Graph *, TulipNodeMetricSorter *>TulipNodeMetricSorter::instances;
TulipNodeMetricSorter *TulipNodeMetricSorter::getInstance(Graph *graph) {
if (instances.find(graph) == instances.end()) {
instances[graph] = new TulipNodeMetricSorter(graph);
}
return instances[graph];
}
TulipNodeMetricSorter::TulipNodeMetricSorter(Graph *graph) : graph(graph) {}
TulipNodeMetricSorter::~TulipNodeMetricSorter() {
reset();
instances.erase(graph);
}
void TulipNodeMetricSorter::sortNodesForProperty(const string& propertyName) {
cleanupSortNodesForProperty(propertyName);
Iterator<node> *nodeIt = graph->getNodes();
while (nodeIt->hasNext()) {
nodeSortingMap[propertyName].push_back(nodeIt->next());
}
delete nodeIt;
const string& propertyType = graph->getProperty(propertyName)->getTypename();
if (propertyType == "double") {
sort(nodeSortingMap[propertyName].begin(), nodeSortingMap[propertyName].end(), NodeMetricPropertyOrderRelation<DoubleType, DoubleProperty>(graph, propertyName));
}
else if (propertyType == "int") {
sort(nodeSortingMap[propertyName].begin(), nodeSortingMap[propertyName].end(), NodeMetricPropertyOrderRelation<IntegerType, IntegerProperty>(graph, propertyName));
}
}
void TulipNodeMetricSorter::cleanupSortNodesForProperty(const std::string& propertyName) {
nodeSortingMap.erase(propertyName);
}
node TulipNodeMetricSorter::getNodeAtRankForProperty(const unsigned int rank, const string& propertyName) {
if (nodeSortingMap.find(propertyName) == nodeSortingMap.end()) {
sortNodesForProperty(propertyName);
}
return nodeSortingMap[propertyName][rank];
}
unsigned int TulipNodeMetricSorter::getNbValuesForProperty(const string& propertyName) {
if (nbValuesPropertyMap.find(propertyName) == nbValuesPropertyMap.end()) {
unsigned int count = 0;
const string& propertyType = graph->getProperty(propertyName)->getTypename();
if (propertyType == "double") {
set<double> sd;
Iterator<node> *nodeIt = graph->getNodes();
while (nodeIt->hasNext()) {
sd.insert(graph->getProperty<DoubleProperty>(propertyName)->getNodeValue(nodeIt->next()));
}
delete nodeIt;
count = sd.size();
}
else if (propertyType == "int") {
set<int> si;
Iterator<node> *nodeIt = graph->getNodes();
while (nodeIt->hasNext()) {
si.insert(graph->getProperty<IntegerProperty>(propertyName)->getNodeValue(nodeIt->next()));
}
delete nodeIt;
count = si.size();
}
nbValuesPropertyMap[propertyName] = count;
}
return nbValuesPropertyMap[propertyName];
}
void TulipNodeMetricSorter::reset() {
nodeSortingMap.clear();
}
unsigned int TulipNodeMetricSorter::getNodeRankForProperty(tlp::node n, const string& propertyName) {
if (nodeSortingMap.find(propertyName) == nodeSortingMap.end()) {
sortNodesForProperty(propertyName);
}
for (unsigned int i = 0 ; i < nodeSortingMap[propertyName].size() ; ++i) {
if (nodeSortingMap[propertyName][i] == n) {
return i;
}
}
return 0;
}
}
|
