summaryrefslogtreecommitdiff
path: root/Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/force/jedi/algorithms/HuSpringElectricalFW.lua
diff options
context:
space:
mode:
Diffstat (limited to 'Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/force/jedi/algorithms/HuSpringElectricalFW.lua')
-rw-r--r--Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/force/jedi/algorithms/HuSpringElectricalFW.lua48
1 files changed, 23 insertions, 25 deletions
diff --git a/Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/force/jedi/algorithms/HuSpringElectricalFW.lua b/Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/force/jedi/algorithms/HuSpringElectricalFW.lua
index 57cd1547b6c..08ccad1308f 100644
--- a/Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/force/jedi/algorithms/HuSpringElectricalFW.lua
+++ b/Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/force/jedi/algorithms/HuSpringElectricalFW.lua
@@ -20,31 +20,29 @@ declare {
key = "jedi spring electric layout",
algorithm = HuClass,
documentation_in = "documentation_hu_layout",
- preconditions = { connected = true },
+ preconditions = { connected = true },
postconditions = {fixed = true},
- summary = "This layout uses the spring electric algorithm proposed by Hu to draw graphs.",
+ summary = "This layout uses the spring electric algorithm proposed by Hu to draw graphs.",
- documentation = [[
- The spring electric algorithm by Hu uses two kinds of forces and coarsening.
- It is described in:
- %
- \begin{itemize}
- \item
- Yifan Hu,
- \newblock Efficient, high quality force-directed graph drawing,
- \newblock \emph{The Mathematica Journal,}
- 10(1), 37--71, 2006.
- \end{itemize}
- %
- This algorithm uses spring forces as attractive forces between vertices
- connected by an edge and electric forces as repulsive forces between
- all vertex pairs. Hu introduces coarsening, a procedure which repeatedly
- merges vertices in order to obtain a smaller version of the graph, to
- overcome local minima. He also uses the Barnes-Hut algorithm to enhance
- the runtime of his algorithms. This algorithm is not used in this
- implementation. This layout was implemented by using the Jedi framework.
- ]],
+ documentation =
+ [[The spring electric algorithm by Hu uses two kinds of forces and coarsening.
+ It is described in:
+ \begin{itemize}
+ \item
+ Yifan Hu,
+ \newblock Efficient, high quality force-directed graph drawing,
+ \newblock \emph{The Mathematica Journal,}
+ 10(1), 37-71, 2006.
+ \end{itemize}
+ This algorithm uses spring forces as attractive forces between vertices
+ connected by an edge and electric forces as repulsive forces between
+ all vertex pairs. Hu introduces coarsening, a procedure which repeatedly
+ merges vertices in order to obtain a smaller version of the graph, to
+ overcome local minima. He also uses the Barnes-Hut algorithm to enhance
+ the runtime of his algorithms. This algorithm is not used in this
+ implementation. This layout was implemented by using the Jedi framework.
+ ]],
example =
[[
@@ -54,15 +52,15 @@ declare {
b -- {c, d, e},
c -- {d, e},
d --e
- };
- ]],
+ };
+ ]],
example =
[[
\tikz
\graph[spring electric fw layout, speed = 0.35, node distance = 1cm, horizontal = c to l, nodes={as=,circle, draw, inner sep=3pt,outer sep=0pt}, maximum displacement per step = 10]{
a -> b -> c -> {d1 -> e -> f -> g -> h -> i -> {j1 -> e, j2 -> l}, d2 -> l -> m}, m -> a
- };
+ };
]]
}