1 |
|
|
/*************************************** |
2 |
|
|
Auteur : Pierre Aubert |
3 |
|
|
Mail : pierre.aubert@lapp.in2p3.fr |
4 |
|
|
Licence : CeCILL-C |
5 |
|
|
****************************************/ |
6 |
|
|
|
7 |
|
|
#include "Graph.h" |
8 |
|
|
|
9 |
|
|
///Test the graph conversion to dot |
10 |
|
1 |
void testGraphToDot(){ |
11 |
✓ |
2 |
Graph<bool, long> graph; |
12 |
|
|
|
13 |
✓✓ |
1 |
long nodeA = graph.createNode(true, "a"); |
14 |
✓✓ |
1 |
long nodeB = graph.createNode(true, "b"); |
15 |
✓✓ |
1 |
long nodeC = graph.createNode(true, "c"); |
16 |
✓✓ |
1 |
long nodeD = graph.createNode(true, "d"); |
17 |
✓✓ |
1 |
long nodeE = graph.createNode(true, "e"); |
18 |
|
|
|
19 |
✓✓ |
1 |
long nodeRemove = graph.createNode(true, "to be removed"); |
20 |
|
|
|
21 |
✓ |
1 |
graph.connectNode(nodeA, nodeC); |
22 |
✓ |
1 |
graph.connectNode(nodeB, nodeC); |
23 |
✓ |
1 |
graph.connectNode(nodeC, nodeE); |
24 |
✓ |
1 |
graph.connectNode(nodeD, nodeE); |
25 |
|
|
|
26 |
✓ |
1 |
graph.connectNode(nodeB, nodeRemove); |
27 |
✓ |
1 |
graph.connectNode(nodeRemove, nodeE); |
28 |
|
|
|
29 |
✓✓ |
1 |
graph.savePng("testGraphBase.png"); |
30 |
|
|
|
31 |
✓ |
1 |
Graph<bool, long> graphLinkedRemove(graph); |
32 |
✓ |
1 |
graph.removeNode(nodeRemove); |
33 |
|
|
|
34 |
✓✓ |
1 |
graph.savePng("testGraphRemove.png"); |
35 |
|
|
|
36 |
✓ |
1 |
graphLinkedRemove.removeNode(nodeRemove, true); |
37 |
✓✓ |
1 |
graphLinkedRemove.savePng("testGraphLinkedRemove.png"); |
38 |
|
1 |
} |
39 |
|
|
|
40 |
|
|
|
41 |
|
1 |
int main(int argc, char** argv){ |
42 |
|
1 |
testGraphToDot(); |
43 |
|
1 |
return 0; |
44 |
|
|
} |
45 |
|
|
|
46 |
|
|
|