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
|
#include <iostream>
#include <tulip/TlpTools.h>
#include <tulip/Graph.h>
#include <tulip/AcyclicTest.h>
#include <tulip/ConnectedTest.h>
#include <tulip/PlanarityTest.h>
#include <tulip/OuterPlanarTest.h>
#include <tulip/SimpleTest.h>
#include <tulip/TreeTest.h>
/**
* Tutorial 008
*
* Create a graph and perform a few tests on it.
*
*/
using namespace std;
using namespace tlp;
int main() {
//initialize the Tulip libs
initTulipLib(NULL);
//create an empty graph
Graph *graph = newGraph();
//add the nodes
node n0 = graph->addNode();
node n1 = graph->addNode();
node n2 = graph->addNode();
node n3 = graph->addNode();
//add the edges
edge e0 = graph->addEdge(n1,n2);
edge e1 = graph->addEdge(n0,n1);
edge e2 = graph->addEdge(n2,n0);
edge e3 = graph->addEdge(n3,n0);
//run the tests
if (AcyclicTest::isAcyclic(graph))
cout << "The graph is acyclic" << endl;
else
cout << "The graph is cyclic" << endl;
if (ConnectedTest::isConnected(graph))
cout << "The graph is connected" << endl;
else
cout << "The graph is not connected" << endl;
if (PlanarityTest::isPlanar(graph))
cout << "The graph is planar" << endl;
else
cout << "The graph is not planar" << endl;
if (SimpleTest::isSimple(graph))
cout << "The graph is simple" << endl;
else
cout << "The graph is not simple" << endl;
if (TreeTest::isTree(graph))
cout << "The graph is a tree" << endl;
else
cout << "The graph is not a tree" << endl;
delete graph;
return EXIT_SUCCESS;
}
|
