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
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
|
/**
*
* 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 <iostream>
#include <tulip/Graph.h>
/**
* Tutorial 006
*
* Create a graph
* Order the edge around the nodes
*/
using namespace std;
using namespace tlp;
void buildGraph(Graph *graph) {
//add three nodes
node n1=graph->addNode();
node n2=graph->addNode();
node n3=graph->addNode();
//add three edges
graph->addEdge(n2,n3);
graph->addEdge(n1,n2);
graph->addEdge(n3,n1);
}
void displayAdjacency(node n, Graph *graph) {
Iterator<edge>*ite=graph->getInOutEdges(n);
while(ite->hasNext())
cout << ite->next().id << " ";
delete ite;
cout << endl;
}
int main() {
//create an empty graph
Graph *graph=tlp::newGraph();
//build the graph
node n1=graph->addNode();
node n2=graph->addNode();
node n3=graph->addNode();
node n4=graph->addNode();
//add three edges
edge e1=graph->addEdge(n2,n3);
edge e2=graph->addEdge(n1,n2);
edge e3=graph->addEdge(n3,n1);
edge e4=graph->addEdge(n4,n1);
//display current order of edge around n1
displayAdjacency(n1,graph);
//change e2 et e4
graph->swapEdgeOrder(n1,e2,e4);
//display the new order of edge around n1
displayAdjacency(n1,graph);
vector<edge> tmp(2);
tmp[0]=e2;
tmp[1]=e4;
graph->setEdgeOrder(n1,tmp);
//display the new order of edge around n1
displayAdjacency(n1,graph);
delete graph;
return EXIT_SUCCESS;
}
|
