summaryrefslogtreecommitdiff
path: root/Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/doc/ogdf/energybased/SpringEmbedderKK.lua
diff options
context:
space:
mode:
Diffstat (limited to 'Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/doc/ogdf/energybased/SpringEmbedderKK.lua')
-rw-r--r--Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/doc/ogdf/energybased/SpringEmbedderKK.lua50
1 files changed, 26 insertions, 24 deletions
diff --git a/Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/doc/ogdf/energybased/SpringEmbedderKK.lua b/Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/doc/ogdf/energybased/SpringEmbedderKK.lua
index a4fd46aa775..0d130b19235 100644
--- a/Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/doc/ogdf/energybased/SpringEmbedderKK.lua
+++ b/Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/doc/ogdf/energybased/SpringEmbedderKK.lua
@@ -18,38 +18,40 @@ local example = require 'pgf.gd.doc'.example
--------------------------------------------------------------------------------
key "SpringEmbedderKK"
-summary "The spring embedder of Kamada and Kawai"
-
+summary "The spring embedder of Kamada and Kawai"
+
documentation [[
- The implementation used in |SpringEmbedderKK| is based on
- the following publication:
-
- Tomihisa Kamada, Satoru Kawai: \emph{An Algorithm for Drawing
- General Undirected Graphs.} Information Processing Letters 31, pp. 7--15, 1989.
-
- There are some parameters that can be tuned to optimize the
- algorithm's behavior regarding runtime and layout quality.
- First of all note that the algorithm uses all pairs shortest path
- to compute the graph theoretic distance. This can be done either
- with BFS (ignoring node sizes) in quadratic time or by using
- e.g. Floyd's algorithm in cubic time with given edge lengths
- that may reflect the node sizes. Also |m_computeMaxIt| decides
- if the computation is stopped after a fixed maximum number of
- iterations. The desirable edge length can either be set or computed
- from the graph and the given layout.
+ The implementation used in |SpringEmbedderKK| is based on
+ the following publication:
+
+ Tomihisa Kamada, Satoru Kawai: \emph{An Algorithm for Drawing
+ General Undirected Graphs.} Information Processing Letters 31, pp. 7--15, 1989.
+
+ There are some parameters that can be tuned to optimize the
+ algorithm's behavior regarding runtime and layout quality.
+ First of all note that the algorithm uses all pairs shortest path
+ to compute the graph theoretic distance. This can be done either
+ with BFS (ignoring node sizes) in quadratic time or by using
+ e.g. Floyd's algorithm in cubic time with given edge lengths
+ that may reflect the node sizes. Also |m_computeMaxIt| decides
+ if the computation is stopped after a fixed maximum number of
+ iterations. The desirable edge length can either be set or computed
+ from the graph and the given layout.
+
]]
--------------------------------------------------------------------------------
-
+
--------------------------------------------------------------------------------
key "SpringEmbedderKK.stopTolerance"
summary "Sets the value for the stop tolerance."
-documentation [[
- Below this value, the system is regarded stable (balanced) and the
- optimization stopped.
+documentation
+[[
+Below this value, the system is regarded stable (balanced) and the
+optimization stopped.
]]
--------------------------------------------------------------------------------
-
+
--------------------------------------------------------------------------------
key "SpringEmbedderKK.desLength"
@@ -59,4 +61,4 @@ summary "Sets desirable edge length directly"
-- Local Variables:
-- mode:latex
--- End:
+-- End: