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
|
-- Copyright 2012 by Till Tantau
--
-- This file may be distributed and/or modified
--
-- 1. under the LaTeX Project Public License and/or
-- 2. under the GNU Public License
--
-- See the file doc/generic/pgf/licenses/LICENSE for more information
-- @release $Header$
local declare = require("pgf.gd.interface.InterfaceToAlgorithms").declare
---
-- @section subsection {Layer Assignment (Node Ranking)}
--
-- Algorithms for producing layered drawings place nodes on discrete
-- layers from top to bottom. Layer assignment is the problem of
-- finding a partition so that for all edges $e = (u,v) \in E(G)$ the
-- equation $\mathit{layer}(u) < \mathit{layer}(v)$ holds. Such a
-- partition is called a \emph{layering}. This definition can be extended by
-- introducing edge weights or priorities and minimum length
-- constraints which has practical applications and allows users to
-- fine-tune the results.
--
-- For more details, please see Section 4.1.2 of Pohlmann's Diploma
-- thesis.
--
-- @end
---
declare {
key = "linear optimization layer assignment",
algorithm = require "pgf.gd.layered.NodeRankingGansnerKNV1993",
phase = "node ranking",
phase_default = true,
summary = [["
This layer assigment method, due to Gasner et al., is based on a
linear optimization problem.
"]],
documentation = [["
For more details, please see Section 4.1.2 of Pohlmann's Diploma
thesis.
This is the default algorithm for layer assignments.
"]]
}
---
declare {
key = "minimum height layer assignment",
algorithm = "pgf.gd.layered.NodeRankingMinimumHeight",
phase = "node ranking",
summary = [["
This layer assigment method minimizes the height of the resulting
graph.
"]],
documentation = [["
For more details, please see Section 4.1.3 of Pohlmann's Diploma
thesis.
"]]
}
|