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
|
/**
*
* 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 <ctime>
#include <tulip/TulipPluginHeaders.h>
using namespace std;
using namespace tlp;
struct edgeS {
unsigned source,target;
};
namespace std {
template<>
struct less<edgeS> {
bool operator()(const edgeS &c,const edgeS &d) const {
int cs,ct,ds,dt;
if (c.source<=c.target) {
cs=c.source;
ct=c.target;
}
else {
ct=c.source;
cs=c.target;
}
if (d.source<=d.target) {
ds=d.source;
dt=d.target;
}
else {
dt=d.source;
ds=d.target;
}
return (cs < ds) || ((cs == ds) && (ct < dt));
}
};
}
namespace {
const char * paramHelp[] = {
// nodes
HTML_HELP_OPEN() \
HTML_HELP_DEF( "type", "unsigned int" ) \
HTML_HELP_DEF( "default", "500" ) \
HTML_HELP_BODY() \
"Number of nodes in the final graph." \
HTML_HELP_CLOSE(),
// edges
HTML_HELP_OPEN() \
HTML_HELP_DEF( "type", "unsigned int" ) \
HTML_HELP_DEF( "default", "1000" ) \
HTML_HELP_BODY() \
"Number of edges in the final graph." \
HTML_HELP_CLOSE(),
};
}
/** \addtogroup import */
/// Random Simple Graph - Import of a random simple graph
/** This plugin enables to create a random simple graph
*
* User can specify the number of nodes and the number of edges of the graph.
*/
class RandomSimpleGraph:public ImportModule {
public:
PLUGININFORMATION("Random Simple Graph","Auber","16/06/2002","Imports a new randomly generated simple graph.","1.0","Graph")
RandomSimpleGraph(tlp::PluginContext* context):ImportModule(context) {
addInParameter<unsigned int>("nodes",paramHelp[0],"500");
addInParameter<unsigned int>("edges",paramHelp[1],"1000");
}
bool importGraph() {
// initialize a random sequence according the given seed
tlp::initRandomSequence();
unsigned int nbNodes = 5;
unsigned int nbEdges = 9;
if (dataSet!=NULL) {
dataSet->get("nodes", nbNodes);
dataSet->get("edges", nbEdges);
}
if (nbNodes == 0) {
if (pluginProgress)
pluginProgress->setError(string("Error: the number of nodes cannot be null"));
return false;
}
int ite = nbNodes*nbEdges;
int nbIteration = ite;
set<edgeS> myGraph;
if (pluginProgress)
pluginProgress->showPreview(false);
while (ite>0) {
if (ite%nbNodes==1) if (pluginProgress->progress(nbIteration-ite,nbIteration)!=TLP_CONTINUE)
return pluginProgress->state()!=TLP_CANCEL;
edgeS tmp;
tmp.source=rand()%nbNodes;
tmp.target=rand()%nbNodes;
while (tmp.source==tmp.target) {
tmp.source=rand()%nbNodes;
tmp.target=rand()%nbNodes;
}
if (myGraph.find(tmp)==myGraph.end()) {
myGraph.insert(tmp);
if (myGraph.size() == nbEdges)
break;
}
ite--;
}
vector<node> tmpVect(nbNodes);
graph->addNodes(nbNodes, tmpVect);
graph->reserveEdges(myGraph.size());
for (set<edgeS>::iterator it=myGraph.begin(); it!=myGraph.end(); ++it) {
graph->addEdge(tmpVect[it->source],tmpVect[it->target]);
}
return true;
}
};
PLUGIN(RandomSimpleGraph)
|
