summaryrefslogtreecommitdiff
path: root/Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/doc/ogdf/layered/FastHierarchyLayout.lua
diff options
context:
space:
mode:
authorKarl Berry <karl@freefriends.org>2019-05-12 20:23:02 +0000
committerKarl Berry <karl@freefriends.org>2019-05-12 20:23:02 +0000
commit22cbaf8cd711b82b3fe4b387a7e72b58409ecdbd (patch)
tree0b785b59273566c030b567add8671b7f06167054 /Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/doc/ogdf/layered/FastHierarchyLayout.lua
parent692a797099b0acfd35d4bbd6a322acdc87c2c3a8 (diff)
pgf
git-svn-id: svn://tug.org/texlive/trunk@51107 c570f23f-e606-0410-a88d-b1316a301751
Diffstat (limited to 'Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/doc/ogdf/layered/FastHierarchyLayout.lua')
-rw-r--r--Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/doc/ogdf/layered/FastHierarchyLayout.lua14
1 files changed, 7 insertions, 7 deletions
diff --git a/Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/doc/ogdf/layered/FastHierarchyLayout.lua b/Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/doc/ogdf/layered/FastHierarchyLayout.lua
index 4d45270a01f..a7baad7e109 100644
--- a/Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/doc/ogdf/layered/FastHierarchyLayout.lua
+++ b/Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/doc/ogdf/layered/FastHierarchyLayout.lua
@@ -23,21 +23,21 @@ documentation
[[
This class implements a hierarchy layout algorithm, that is, it
layouts hierarchies with a given order of nodes on each
-layer. It is used as a third phase of the Sugiyama algorithm.
+layer. It is used as a third phase of the Sugiyama algorithm.
All edges of the layout will have at most two
bends. Additionally, for each edge having exactly two bends, the
segment between them is drawn vertically. This applies in
particular to the long edges arising in the first phase of the
-Sugiyama algorithm.
+Sugiyama algorithm.
The implementation is based on:
-
+%
\begin{itemize}
-\item
- Christoph Buchheim, Michael Jünger, Sebastian Leipert: A Fast
- Layout Algorithm for k-Level Graphs. \emph{Proc. Graph
- Drawing 2000}, volumne 1984 of LNCS, pages 229--240, 2001.
+ \item
+ Christoph Buchheim, Michael Jünger, Sebastian Leipert: A Fast
+ Layout Algorithm for k-Level Graphs. \emph{Proc. Graph
+ Drawing 2000}, volume 1984 of LNCS, pages 229--240, 2001.
\end{itemize}
]]