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
|
/**
*
* This file is part of Tulip (https://tulip.labri.fr)
*
* 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 <ctime>
#include <cmath>
#include <climits>
#include <tulip/TulipPluginHeaders.h>
using namespace std;
using namespace tlp;
static const int WIDTH = 1024;
static const int HEIGHT = 1024;
static const char *paramHelp[] = {
// nodes
"Number of nodes in the final graph.",
// degree
"Average degree of the nodes in the final graph.",
// long edge
"If true, long distance edges are added in the grid approximation."};
/*
* TODO :
* Use a quadtree in order to change the complexity from n*n to n*log(n)
*/
/** \addtogroup import */
/// Grid Approximation - Import of a grid approximation
/** This plugin enables to create a grid approximation
*
* User can specify the number of nodes and their average degree.
*/
class SmallWorldGraph : public ImportModule {
public:
PLUGININFORMATION("Grid Approximation", "Auber", "25/06/2002",
"Imports a new grid approximation graph.", "1.0", "Graph")
SmallWorldGraph(tlp::PluginContext *context) : ImportModule(context) {
addInParameter<unsigned int>("nodes", paramHelp[0], "200");
addInParameter<unsigned int>("degree", paramHelp[1], "10");
addInParameter<bool>("long edge", paramHelp[2], "false");
}
~SmallWorldGraph() override {}
bool importGraph() override {
unsigned int nbNodes = 200;
unsigned int avgDegree = 10;
bool enableLongEdge = false;
if (dataSet != nullptr) {
dataSet->get("nodes", nbNodes);
dataSet->get("degree", avgDegree);
dataSet->get("long edge", enableLongEdge);
}
if (nbNodes == 0) {
if (pluginProgress)
pluginProgress->setError("Error: \"nodes\" cannot be null");
return false;
}
if (avgDegree == 0) {
if (pluginProgress)
pluginProgress->setError("Error: \"degree\" cannot be null");
return false;
}
double maxDistance =
sqrt(double(avgDegree) * double(WIDTH) * double(HEIGHT) / (double(nbNodes) * M_PI));
// initialize a random sequence according the given seed
tlp::initRandomSequence();
LayoutProperty *newLayout = graph->getLocalProperty<LayoutProperty>("viewLayout");
pluginProgress->showPreview(false);
vector<node> nodes;
graph->addNodes(nbNodes, nodes);
graph->reserveEdges(nbNodes * avgDegree);
for (auto n : nodes) {
newLayout->setNodeValue(n,
Coord(float(randomInteger(WIDTH)), float(randomInteger(HEIGHT)), 0));
}
// double minSize = DBL_MAX;
for (unsigned int i = 0; i < nbNodes - 1; ++i) {
bool longEdge = false;
for (unsigned int j = i + 1; j < nbNodes; ++j) {
if (i != j) {
double distance =
newLayout->getNodeValue(nodes[i]).dist(newLayout->getNodeValue(nodes[j]));
// minSize = std::min(distance, minSize);
// newSize->setAllNodeValue(Size(minSize/2.0, minSize/2.0, 1));
if (distance < maxDistance)
graph->addEdge(nodes[i], nodes[j]);
else if (!longEdge && enableLongEdge) {
double distrand = randomDouble();
if (distrand < 1.0 / (2.0 + double(nbNodes - i - 1))) {
longEdge = true;
graph->addEdge(nodes[i], nodes[j]);
}
}
}
}
if (((i % 100) == 0) && (pluginProgress->progress(i, nbNodes - 1) != TLP_CONTINUE))
break;
}
return pluginProgress->state() != TLP_CANCEL;
}
};
PLUGIN(SmallWorldGraph)
|
