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
|
/**
*
* 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 <tulip/AcyclicTest.h>
#include <tulip/GraphTest.h>
class AcyclicTest : public tlp::GraphTest {
public:
PLUGININFORMATION("Acyclic", "Tulip team", "18/04/2012", "Tests whether a graph is acyclic or not.", "1.0", "Topological Test")
AcyclicTest(const tlp::PluginContext* context) : tlp::GraphTest(context) {
}
virtual bool test() {
return tlp::AcyclicTest::isAcyclic(graph);
}
};
PLUGIN(AcyclicTest)
class MakeAcyclic : public tlp::Algorithm {
public:
PLUGININFORMATION("Make Acyclic", "Tulip team", "18/04/2012", "Makes a graph acyclic.", "1.0", "Topology Update")
MakeAcyclic(const tlp::PluginContext* context) : tlp::Algorithm(context) {
}
virtual bool run() {
std::vector<tlp::edge> edges;
std::vector<tlp::SelfLoops> selfLoops;
tlp::AcyclicTest::makeAcyclic(graph, edges, selfLoops);
return true;
}
};
PLUGIN(MakeAcyclic)
|
