summaryrefslogtreecommitdiff
path: root/Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/layered/library.lua
diff options
context:
space:
mode:
Diffstat (limited to 'Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/layered/library.lua')
-rw-r--r--Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/layered/library.lua57
1 files changed, 27 insertions, 30 deletions
diff --git a/Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/layered/library.lua b/Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/layered/library.lua
index 950e02ffa36..9f681929ecb 100644
--- a/Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/layered/library.lua
+++ b/Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/layered/library.lua
@@ -30,37 +30,34 @@
-- implemented it as part of his Diploma thesis. Please consult this
-- thesis for a detailed explanation of the Sugiyama method and its
-- history:
--- %
+--
-- \begin{itemize}
--- \item
--- Jannis Pohlmann,
--- \newblock \emph{Configurable Graph Drawing Algorithms
--- for the \tikzname\ Graphics Description Language,}
--- \newblock Diploma Thesis,
--- \newblock Institute of Theoretical Computer Science, Universit\"at
--- zu L\"ubeck, 2011.\\[.5em]
--- \newblock Available online via
--- \url{http://www.tcs.uni-luebeck.de/downloads/papers/2011/}\\
--- \url{2011-configurable-graph-drawing-algorithms-jannis-pohlmann.pdf}
--- \\[.5em]
--- (Note that since the publication of this thesis some option names
--- have been changed. Most noticeably, the option name
--- |layered drawing| was changed to |layered layout|, which is somewhat
--- more consistent with other names used in the graph drawing
--- libraries. Furthermore, the keys for choosing individual
--- algorithms for the different algorithm phases, have all changed.)
+-- \item
+-- Jannis Pohlmann,
+-- \newblock \emph{Configurable Graph Drawing Algorithms
+-- for the \tikzname\ Graphics Description Language,}
+-- \newblock Diploma Thesis,
+-- \newblock Institute of Theoretical Computer Science, Univerist\"at
+-- zu L\"ubeck, 2011.\\[.5em]
+-- \newblock Available online via
+-- \url{http://www.tcs.uni-luebeck.de/downloads/papers/2011/}\\ \url{2011-configurable-graph-drawing-algorithms-jannis-pohlmann.pdf}
+-- \\[.5em]
+-- (Note that since the publication of this thesis some option names
+-- have been changed. Most noticeably, the option name
+-- |layered drawing| was changed to |layered layout|, which is somewhat
+-- more consistent with other names used in the graph drawing
+-- libraries. Furthermore, the keys for choosing individual
+-- algorithms for the different algorithm phases, have all changed.)
-- \end{itemize}
--
-- The Sugiyama methods lays out a graph in five steps:
--- %
-- \begin{enumerate}
--- \item Cycle removal.
--- \item Layer assignment (sometimes called node ranking).
--- \item Crossing minimization (also referred to as node ordering).
--- \item Node positioning (or coordinate assignment).
--- \item Edge routing.
+-- \item Cycle removal.
+-- \item Layer assignment (sometimes called node ranking).
+-- \item Crossing minimization (also referred to as node ordering).
+-- \item Node positioning (or coordinate assignment).
+-- \item Edge routing.
-- \end{enumerate}
--- %
-- It turns out that behind each of these steps there lurks an
-- NP-complete problem, which means, in practice, that each step is
-- impossible to perform optimally for larger graphs. For this reason,
@@ -70,11 +67,11 @@
-- A distinctive feature of Pohlmann's implementation of the Sugiyama
-- method for \tikzname\ is that the algorithms used for each of the
-- steps can easily be exchanged, just specify a different option. For
--- the user, this means that by specifying a different option and thereby
--- using a different heuristic for one of the steps, a better layout can
--- often be found. For the researcher, this means that one can very
--- easily test new approaches and new heuristics without having to
--- implement all of the other steps anew.
+-- the user, this means that by specifying a different
+-- option and thereby using a different heuristic for one of the steps, a
+-- better layout can often be found. For the researcher, this means that
+-- one can very easily test new approaches and new heuristics without
+-- having to implement all of the other steps anew.
--
-- @library