summaryrefslogtreecommitdiff
path: root/Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/layered/node_ranking.lua
diff options
context:
space:
mode:
authorKarl Berry <karl@freefriends.org>2019-04-08 17:23:59 +0000
committerKarl Berry <karl@freefriends.org>2019-04-08 17:23:59 +0000
commit9da8ac113f97e68e91e3a1ef26467f9814eb4312 (patch)
treef36b76c9a982931638dde95501c51072185dec56 /Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/layered/node_ranking.lua
parente919fa4b004d0ef401808c337d7def5fa259da0f (diff)
pgf revert to previous release (r49607, committed 5jan19)
git-svn-id: svn://tug.org/texlive/trunk@50867 c570f23f-e606-0410-a88d-b1316a301751
Diffstat (limited to 'Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/layered/node_ranking.lua')
-rw-r--r--Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/layered/node_ranking.lua40
1 files changed, 21 insertions, 19 deletions
diff --git a/Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/layered/node_ranking.lua b/Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/layered/node_ranking.lua
index c663d9ce366..7aef0bde5fc 100644
--- a/Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/layered/node_ranking.lua
+++ b/Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/layered/node_ranking.lua
@@ -18,15 +18,15 @@ local declare = require("pgf.gd.interface.InterfaceToAlgorithms").declare
--
-- 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
+-- 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.
+-- For more details, please see Section 4.1.2 of Pohlmann's Diploma
+-- thesis.
--
-- @end
@@ -40,17 +40,17 @@ declare {
phase = "node ranking",
phase_default = true,
- summary = [["
- This layer assignment method, due to Gasner et al., is based on a
- linear optimization problem.
+ 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.
- "]]
-}
+ documentation = [["
+ For more details, please see Section 4.1.2 of Pohlmann's Diploma
+ thesis.
+
+ This is the default algorithm for layer assignments.
+ "]]
+ }
@@ -61,12 +61,14 @@ declare {
algorithm = "pgf.gd.layered.NodeRankingMinimumHeight",
phase = "node ranking",
- summary = [["
- This layer assignment method minimizes the height of the resulting graph.
+ 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.
- "]]
-}
+ documentation = [["
+ For more details, please see Section 4.1.3 of Pohlmann's Diploma
+ thesis.
+ "]]
+ }