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
|
/**
*
* This file is part of Tulip (www.tulip-software.org)
*
* Authors: David Auber and the Tulip development Team
* from LaBRI, University of Bordeaux 1 and Inria Bordeaux - Sud Ouest
*
* 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 <cassert>
#include <tulip/BooleanProperty.h>
#include <tulip/AcyclicTest.h>
#include "SpanningDagSelection.h"
BOOLEANPLUGIN(SpanningDagSelection,"Spanning Dag","David Auber","01/12/1999","Alpha","1.0");
using namespace std;
using namespace tlp;
//=================================================================
SpanningDagSelection::SpanningDagSelection(const tlp::PropertyContext &context):BooleanAlgorithm(context) {}
//=================================================================
bool SpanningDagSelection::run() {
booleanResult->setAllNodeValue(true);
booleanResult->setAllEdgeValue(true);
vector<edge> obstructions;
AcyclicTest::acyclicTest(graph, &obstructions);
for (vector<edge>::const_iterator it = obstructions.begin(); it != obstructions.end(); ++it) {
booleanResult->setEdgeValue(*it, false);
}
return true;
}
//=================================================================
|
