summaryrefslogtreecommitdiff
path: root/Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/experimental/evolving/doc.lua
diff options
context:
space:
mode:
Diffstat (limited to 'Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/experimental/evolving/doc.lua')
-rw-r--r--Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/experimental/evolving/doc.lua50
1 files changed, 27 insertions, 23 deletions
diff --git a/Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/experimental/evolving/doc.lua b/Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/experimental/evolving/doc.lua
index 801e3808bb4..dbd81462758 100644
--- a/Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/experimental/evolving/doc.lua
+++ b/Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/experimental/evolving/doc.lua
@@ -26,26 +26,27 @@ documentation
A method to create layouts for evolving graphs as an SVG animation.The Reingold--Tilford method is a standard method for drawing
trees. It is described in:
-The algorithm, which is based on the Reingold--Tilford algorithm and
+The algorithm, which is based on the Reingold--Tilford algorithm and
its implementation in |graphdrawing.trees|, is introduced in my Masthesis:
+%
\begin{itemize}
-\item
- M.\ Skambath,
- \newblock Algorithmic Drawing of Evolving Trees, Masterthesis, 2016
+ \item
+ M.\ Skambath,
+ \newblock Algorithmic Drawing of Evolving Trees, Masterthesis, 2016
\end{itemize}
-You can use the same known graph macros as for other graph drawing
-algorithms in Ti\emph{k}Z. In addition all keys and features that
+You can use the same known graph macros as for other graph drawing
+algorithms in Ti\emph{k}Z. In addition all keys and features that
are available for the static tree algorithm can be used:
-
+%
\begin{codeexample}[animation list={1,1.5,2,2.5,3,3.5,4}]
\tikz \graph[animated binary tree layout,
nodes={draw,circle}, auto supernode,
- ] {
- {[when=1] 15 -> {10 -> { ,11}, 20 }},
- {[when=2] 15 -> {10 -> {3,11}, 20 }},
- {[when=3] 15 -> {10 -> {3, }, 20 }},
- {[when=4] 15 -> {10 -> {3, }, 20 -> 18 }},
+ ] {
+ {[when=1] 15 -> {10 -> { ,11}, 20 }},
+ {[when=2] 15 -> {10 -> {3,11}, 20 }},
+ {[when=3] 15 -> {10 -> {3, }, 20 }},
+ {[when=4] 15 -> {10 -> {3, }, 20 -> 18 }},
};
\end{codeexample}
]]
@@ -54,11 +55,11 @@ are available for the static tree algorithm can be used:
example
[[
\tikz[animated binary tree layout]
- \graph[nodes={draw,circle}, auto supernode] {
- {[when=1] 15 -> {10 -> { ,11}, 20 }},
- {[when=2] 15 -> {10 -> {3,11}, 20 }},
- {[when=3] 15 -> {10 -> {3, }, 20 }},
- {[when=4] 15 -> {10 -> {3, }, 20 -> 18 }},
+ \graph[nodes={draw,circle}, auto supernode] {
+ {[when=1] 15 -> {10 -> { ,11}, 20 }},
+ {[when=2] 15 -> {10 -> {3,11}, 20 }},
+ {[when=3] 15 -> {10 -> {3, }, 20 }},
+ {[when=4] 15 -> {10 -> {3, }, 20 -> 18 }},
};
]]
--------------------------------------------------------------------
@@ -76,15 +77,17 @@ key "animated binary tree layout"
summary
[[ A layout based on the Reingold--Tilford method for drawing
-binary trees. ]]
+binary trees.
+]]
documentation
[[
This key executes:
+%
\begin{enumerate}
-\item |animated tree layout|, thereby selecting the Reingold--Tilford method,
-\item |minimum number of children=2|, thereby ensuring the all nodes
- have (at least) two children or none at all, and
+ \item |animated tree layout|, thereby selecting the Reingold--Tilford method,
+ \item |minimum number of children=2|, thereby ensuring the all nodes
+ have (at least) two children or none at all, and
\end{enumerate}
]]
@@ -99,14 +102,15 @@ example
--------------------------------------------------------------------
-
+
--------------------------------------------------------------------
key "extended animated binary tree layout"
summary
[[ This algorithm is similar to |animated binary tree layout|, only the
option \texttt{missing nodes get space} is executed and the
-\texttt{significant sep} is zero. ]]
+\texttt{significant sep} is zero.
+]]
example
[[