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
|
/**
*
* 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/PlanarityTest.h>
#include <tulip/GraphTest.h>
class PlanarityTest : public tlp::GraphTest {
public:
PLUGININFORMATION("Planar", "Tulip team", "18/04/2012", "Tests whether a graph is planar or not.", "1.0", "Topological Test")
PlanarityTest(const tlp::PluginContext* context) : tlp::GraphTest(context) {
}
virtual bool test() {
return tlp::PlanarityTest::isPlanar(graph);
}
};
PLUGIN(PlanarityTest)
class PlanarEmbeddingTest : public tlp::GraphTest {
public:
PLUGININFORMATION("Planar Embedding", "Tulip team", "18/04/2012", "Tests whether a graph is planar embedding or not.", "1.0", "Topological Test")
PlanarEmbeddingTest(const tlp::PluginContext* context) : tlp::GraphTest(context) {
}
virtual bool test() {
return tlp::PlanarityTest::isPlanarEmbedding(graph);
}
};
PLUGIN(PlanarEmbeddingTest)
class MakePlanarEmbedding : public tlp::Algorithm {
public:
PLUGININFORMATION("Make Planar Embedding", "Tulip team", "18/04/2012", "Makes the graph a planar embedding if it is planar.", "1.0", "Topology Update")
MakePlanarEmbedding(const tlp::PluginContext* context) : tlp::Algorithm(context) {
}
virtual bool run() {
return tlp::PlanarityTest::planarEmbedding(graph);
}
virtual bool check(std::string &) {
return tlp::PlanarityTest::isPlanar(graph);
}
};
PLUGIN(MakePlanarEmbedding)
|
