blob: 8a117f1fc6f135b07b433cd50c4c003e14f7c762 (
plain)
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
|
#include <pgf/gd/ogdf/c/InterfaceFromOGDF.h>
#include "SugiyamaLayout_script.h"
#include "LongestPathRanking_script.h"
#include "OptimalRanking_script.h"
#include "CoffmanGrahamRanking_script.h"
#include "DfsAcyclicSubgraph_script.h"
#include "GreedyCycleRemoval_script.h"
#include "BarycenterHeuristic_script.h"
#include "GreedyInsertHeuristic_script.h"
#include "SiftingHeuristic_script.h"
#include "MedianHeuristic_script.h"
#include "SplitHeuristic_script.h"
#include "FastHierarchyLayout_script.h"
#include "FastSimpleHierarchyLayout_script.h"
struct layered_script :
scripting::declarations
{
void declare (scripting::script s) {
using namespace scripting;
using namespace ogdf;
s.declare (new SugiyamaLayout_script);
s.declare (new LongestPathRanking_script);
s.declare (new OptimalRanking_script);
s.declare (new CoffmanGrahamRanking_script);
s.declare (new DfsAcyclicSubgraph_script);
s.declare (new GreedyCycleRemoval_script);
s.declare (new BarycenterHeuristic_script);
s.declare (new GreedyInsertHeuristic_script);
s.declare (new SiftingHeuristic_script);
s.declare (new MedianHeuristic_script);
s.declare (new SplitHeuristic_script);
s.declare (new FastHierarchyLayout_script);
s.declare (new FastSimpleHierarchyLayout_script);
}
};
|