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
|
/**
*
* 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 <tulip/TulipPluginHeaders.h>
using namespace std;
using namespace tlp;
namespace {
const char * paramHelp[] = {
// nodes
HTML_HELP_OPEN() \
HTML_HELP_DEF( "type", "unsigned int" ) \
HTML_HELP_DEF( "default", "5" ) \
HTML_HELP_BODY() \
"Number of nodes in the final graph." \
HTML_HELP_CLOSE(),
// bool
HTML_HELP_OPEN() \
HTML_HELP_DEF( "type", "bool" ) \
HTML_HELP_DEF( "default", "true" ) \
HTML_HELP_BODY() \
"If true, the generated graph is undirected. If false, two edges are created between each pair of nodes." \
HTML_HELP_CLOSE(),
};
}
class CompleteGraph:public ImportModule {
public:
PLUGININFORMATION("Complete General Graph","Auber","16/12/2002","Imports a new complete graph.","1.1","Graph")
CompleteGraph(tlp::PluginContext* context):ImportModule(context) {
addInParameter<unsigned int>("nodes",paramHelp[0],"5");
addInParameter<bool>("undirected",paramHelp[1],"true");
}
bool importGraph() {
unsigned int nbNodes = 5;
bool undirected = true;
if (dataSet!=NULL) {
dataSet->get("nodes", nbNodes);
dataSet->get("undirected", undirected);
}
if (nbNodes == 0) {
if (pluginProgress)
pluginProgress->setError("Error: number of nodes must be greater than 0");
return false;
}
if (pluginProgress)
pluginProgress->showPreview(false);
vector<node> nodes(nbNodes);
graph->reserveNodes(nbNodes);
for (size_t j=0; j<nbNodes; ++j)
nodes[j] = graph->addNode();
if(undirected)
graph->reserveEdges(nbNodes-1);
else
graph->reserveEdges(2*(nbNodes-1));
for (size_t i=0; i < nbNodes-1; ++i)
for (size_t j = i+1; j < nbNodes; ++j) {
graph->addEdge(nodes[i], nodes[j]);
if (!undirected)
graph->addEdge(nodes[j], nodes[i]);
}
return true;
}
};
PLUGIN(CompleteGraph)
|
