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
|
/**
*
* This file is part of Tulip (https://tulip.labri.fr)
*
* 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/AcyclicTest.h>
#include <tulip/StaticProperty.h>
#include "SpanningDagSelection.h"
PLUGIN(SpanningDagSelection)
using namespace std;
using namespace tlp;
//=================================================================
SpanningDagSelection::SpanningDagSelection(const tlp::PluginContext *context)
: BooleanAlgorithm(context) {
addOutParameter<unsigned int>("#edges selected", "The number of 'dag' selected edges");
}
//=================================================================
bool SpanningDagSelection::run() {
for (auto n : graph->nodes())
result->setNodeValue(n, true);
EdgeStaticProperty<bool> edgeprop(graph, true);
vector<edge> obstructions;
AcyclicTest::acyclicTest(graph, &obstructions);
for (auto e : obstructions) {
edgeprop[e] = false;
}
edgeprop.copyToProperty(result);
// output some useful information
if (dataSet != nullptr) {
dataSet->set("#edges selected", uint(graph->numberOfEdges() - obstructions.size()));
}
return true;
}
//=================================================================
|
