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
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
|
/**
*
* 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 "ReachableSubGraphSelection.h"
#include <tulip/StringCollection.h>
using namespace tlp;
PLUGIN(ReachableSubGraphSelection)
namespace {
const char * paramHelp[] = {
// direction
HTML_HELP_OPEN() \
HTML_HELP_DEF( "type", "StringCollection" ) \
HTML_HELP_DEF( "values", "{output edges, input edges, all edges}" ) \
HTML_HELP_DEF( "default", "output edges" ) \
HTML_HELP_BODY() \
"This parameter defines the navigation direction. Following values are corrects :" \
"<ul><li>output edges: follow ouput edges (directed);</li>" \
"<li>input edges: follow input edges (reverse-directed);</li>" \
"<li>all edges: all edges (undirected).</li></ul>" \
HTML_HELP_CLOSE(),
// startingNodes
HTML_HELP_OPEN() \
HTML_HELP_DEF( "type", "Selection" ) \
HTML_HELP_DEF( "default", "\"viewSelection\"" ) \
HTML_HELP_BODY() \
"This parameter defines the starting set of nodes used to walk in the graph." \
HTML_HELP_CLOSE(),
// maxdepth
HTML_HELP_OPEN() \
HTML_HELP_DEF( "type", "int" ) \
HTML_HELP_DEF( "values", "[0,1000000]" ) \
HTML_HELP_DEF( "default", "10" ) \
HTML_HELP_BODY() \
"This parameter defines the maximal distance of reachable nodes." \
HTML_HELP_CLOSE(),
};
std::string edgesDirectionLabels[] = {
"output edges",
"input edges",
"all edges",
};
}
ReachableSubGraphSelection::ReachableSubGraphSelection(const tlp::PluginContext *context):BooleanAlgorithm(context) {
addInParameter<StringCollection> ("edges direction",paramHelp[0],"output edges;input edges;all edges");
addInParameter<BooleanProperty> ("startingnodes",paramHelp[1],"viewSelection");
addInParameter<int> ("distance",paramHelp[2],"5");
}
ReachableSubGraphSelection::~ReachableSubGraphSelection() {}
///===========================================================
bool ReachableSubGraphSelection::run() {
unsigned int maxDistance = 5;
StringCollection edgeDirectionCollecion;
EDGE_TYPE edgeDirection=DIRECTED;
BooleanProperty * startNodes=graph->getProperty<BooleanProperty>("viewSelection");
if ( dataSet!=NULL) {
dataSet->get("distance", maxDistance);
//Get the edge orientation
if(dataSet->get("edges direction",edgeDirectionCollecion)) {
if(edgeDirectionCollecion.getCurrentString() == edgesDirectionLabels[0]) {
edgeDirection = DIRECTED;
}
else if(edgeDirectionCollecion.getCurrentString()== edgesDirectionLabels[1]) {
edgeDirection = INV_DIRECTED;
}
else if(edgeDirectionCollecion.getCurrentString()== edgesDirectionLabels[2]) {
edgeDirection = UNDIRECTED;
}
}
else {
//If the new parameter is not defined search for the old one.
int direction=0;
if(dataSet->get("direction",direction)) {
switch(direction) {
case 0:
edgeDirection = DIRECTED;
break;
case 1:
edgeDirection = INV_DIRECTED;
break;
case 2:
edgeDirection = UNDIRECTED;
}
}
}
dataSet->get("startingnodes", startNodes);
}
if (startNodes) {
// as the input selection property and the result property can be the same one,
// if needed, use a stable iterator to keep a copy of the input selected nodes as all values
// of the result property are reseted to false below
Iterator<node>* itN = (result == startNodes) ?
new StableIterator<tlp::node>(startNodes->getNodesEqualTo(true)) :
startNodes->getNodesEqualTo(true);
std::set<node> reachables;
result->setAllEdgeValue(false);
result->setAllNodeValue(false);
// iterate on startNodes add them and their reachables
node current;
forEach(current, itN) {
reachables.insert(current);
reachableNodes(graph, current, reachables, maxDistance,
edgeDirection);
}
std::set<node>::const_iterator itr = reachables.begin();
std::set<node>::const_iterator ite = reachables.end();
// select nodes
while (itr != ite) {
result->setNodeValue((*itr), true);
++itr;
}
// select corresponding edges
edge e;
forEach(e, graph->getEdges()) {
const std::pair<node, node>& ends = graph->ends(e);
if (result->getNodeValue(ends.first) &&
result->getNodeValue(ends.second))
result->setEdgeValue(e, true);
}
}
else {
result->setAllEdgeValue(false);
result->setAllNodeValue(false);
}
return true;
}
|
