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
|
/**
*
* 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 "InducedSubGraphSelection.h"
using namespace tlp;
PLUGIN(InducedSubGraphSelection)
//=================================================================================
namespace {
const char * paramHelp[] = {
// selectedNodes
HTML_HELP_OPEN() \
HTML_HELP_DEF( "type", "Selection" ) \
HTML_HELP_BODY() \
"Set of nodes for which the induced sub-graph is computed." \
HTML_HELP_CLOSE(),
};
}
//=================================================================================
InducedSubGraphSelection::InducedSubGraphSelection(const tlp::PluginContext* context):
BooleanAlgorithm(context) {
addInParameter<BooleanProperty>("Nodes", paramHelp[0], "viewSelection");
}
//=================================================================================
bool InducedSubGraphSelection::run() {
result->setAllNodeValue(false);
result->setAllEdgeValue(false);
BooleanProperty *entrySelection = NULL;
if (dataSet!=NULL)
dataSet->get("Nodes", entrySelection);
if (entrySelection == NULL)
entrySelection = graph->getProperty<BooleanProperty>("viewSelection");
Iterator<node> *itN = graph->getNodes();
while (itN->hasNext()) {
node itn=itN->next() ;
if (entrySelection->getNodeValue(itn)) {
result->setNodeValue(itn, true);
Iterator<edge> *itE = graph->getOutEdges(itn);
while (itE->hasNext()) {
edge e = itE->next();
node target = graph->target(e);
if (entrySelection->getNodeValue(target))
result->setEdgeValue(e, true);
}
delete itE;
}
}
delete itN;
return true;
}
//=================================================================================
|
