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
|
/**
*
* 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 "reverseedges.h"
#include <tulip/BooleanProperty.h>
PLUGIN(ReverseEdges)
using namespace tlp;
ReverseEdges::ReverseEdges(tlp::PluginContext* context): Algorithm(context) {
addInParameter<BooleanProperty>("selection",
HTML_HELP_OPEN() \
HTML_HELP_DEF("type","BooleanProperty") \
HTML_HELP_DEF("default","viewSelection") \
HTML_HELP_BODY() \
"Only edges selected in this property (or all edges if no property is given) will be reversed." \
HTML_HELP_CLOSE(),
"viewSelection", false);
}
bool ReverseEdges::run() {
BooleanProperty* selection = NULL;
if (dataSet)
dataSet->get<BooleanProperty*>("selection", selection);
Iterator<edge>* ite =
selection ? selection->getEdgesEqualTo(true) : graph->getEdges();
int step = 0, max_step = graph->numberOfEdges();
edge e;
forEach(e, ite) {
if (pluginProgress && ((++step % 10) == 0)) {
ProgressState state = pluginProgress->progress(step, max_step);
if (state != TLP_CONTINUE)
return state != TLP_CANCEL;
}
graph->reverse(e);
}
return true;
}
|
