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
|
/**
*
* 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 "SpanningTreeSelection.h"
#include <tulip/BooleanProperty.h>
#include <tulip/GraphTools.h>
PLUGIN(SpanningTreeSelection)
using namespace std;
using namespace tlp;
SpanningTreeSelection::SpanningTreeSelection(const tlp::PluginContext* context):BooleanAlgorithm(context) {
}
SpanningTreeSelection::~SpanningTreeSelection() {}
///===========================================================
///Calcul l'arbre couvrant
bool SpanningTreeSelection::run() {
if (graph->existProperty("viewSelection")) {
BooleanProperty *viewSelection=graph->getProperty<BooleanProperty>("viewSelection");
Iterator<node> *itN=graph->getNodes();
for (; itN->hasNext();) {
node itn=itN->next();
if (viewSelection->getNodeValue(itn)==true) {
result->setNodeValue(itn, true);
}
}
delete itN;
}
selectSpanningForest(graph, result, pluginProgress);
return true;
}
|
