diff options
author | Karl Berry <karl@freefriends.org> | 2019-05-05 21:38:50 +0000 |
---|---|---|
committer | Karl Berry <karl@freefriends.org> | 2019-05-05 21:38:50 +0000 |
commit | 675266a469958f9238613ad9e8ce6ae637736923 (patch) | |
tree | 869733d71acafaa19a1ce89c0c430d475448ae03 /Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/layered/edge_routing.lua | |
parent | 89916d9520fa753d876b1c3d0b300c91be1eb5d3 (diff) |
pgf
git-svn-id: svn://tug.org/texlive/trunk@51018 c570f23f-e606-0410-a88d-b1316a301751
Diffstat (limited to 'Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/layered/edge_routing.lua')
-rw-r--r-- | Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/layered/edge_routing.lua | 23 |
1 files changed, 11 insertions, 12 deletions
diff --git a/Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/layered/edge_routing.lua b/Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/layered/edge_routing.lua index b790d527e3d..eb9939c74ce 100644 --- a/Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/layered/edge_routing.lua +++ b/Master/texmf-dist/tex/generic/pgf/graphdrawing/lua/pgf/gd/layered/edge_routing.lua @@ -21,10 +21,10 @@ local declare = require("pgf.gd.interface.InterfaceToAlgorithms").declare -- step. This makes sense if all nodes have the same size and -- shape. In practical scenarios, however, this assumption often does -- not hold. In these cases, advanced techniques may have to be --- applied in order to avoid overlaps of nodes and edges. +-- applied in order to avoid overlaps of nodes and edges. -- --- For more details, please see Section 4.1.5 of Pohlmann's Diploma --- thesis. +-- For more details, please see Section~4.1.5 of Pohlmann's Diploma +-- thesis. -- -- @end @@ -38,13 +38,12 @@ declare { phase = "layer edge routing", phase_default = true, - summary = [[" - This edge routing algorithm uses polygonal lines to connect nodes. + summary = [[" + This edge routing algorithm uses polygonal lines to connect nodes. "]], - documentation = [[" - For more details, please see Section 4.1.5 of Pohlmann's Diploma - thesis. - - This is the default algorithm for edge routing. - "]] - } + documentation = [[" + For more details, please see Section~4.1.5 of Pohlmann's Diploma thesis. + + This is the default algorithm for edge routing. + "]] +} |