inkscape/src/libcola/cycle_detector.cpp, branch livecoding An experimental livecoding plugin for Inkscape Updated libs from the Adaptagrams project: libavoid, libcola and libvspc; changed the code to match the new API 2017-07-01T11:36:41+00:00 Sylvain Chiron chironsylvain@orange.fr 2017-07-01T11:36:41+00:00 fd733201b82f39655488a286c89142f321ef9dc9 Signed-off-by: Sylvain Chiron <chironsylvain@orange.fr> 
Signed-off-by: Sylvain Chiron <chironsylvain@orange.fr>
cppcheck: performance + variable type 2013-09-27T20:05:56+00:00 Kris De Gussem kris.degussem@gmail.com 2013-09-27T20:05:56+00:00 8bdeca099355f46c4f112144474ca470889dc668 (bzr r12603) 
(bzr r12603)
 Layout algorithm is now applied to each connected component in the 2006-07-16T13:48:42+00:00 Tim Dwyer tgdwyer@gmail.com 2006-07-16T13:48:42+00:00 07c4a573fb37123709d30ee7a6cc15c9bb15925c selection separately. Previously, behaviour of layout on disconnected graphs was... undefined! (bzr r1421) 
selection separately.  Previously, behaviour of layout on disconnected 
graphs was... undefined!

(bzr r1421)
 Previously graph layout was done using the Kamada-Kawai layout algorithm 2006-07-12T00:55:58+00:00 Tim Dwyer tgdwyer@gmail.com 2006-07-12T00:55:58+00:00 12b21e1d27f43deaa748419919b40b80cedd0ddd implemented in Boost. I am replacing this with a custom implementation of a constrained stress-majorization algorithm. The stress-majorization algorithm is more robust and has better convergence characteristics than Kamada-Kawai, and also simple constraints can be placed on node position (for example, to enforce downward-pointing edges, non-overlap constraints, or cluster constraints). Another big advantage is that we no longer need Boost. I've tested the basic functionality, but I have yet to properly handle disconnected graphs or to properly scale the resulting layout. This commit also includes significant refactoring... the quadratic program solver - libvpsc (Variable Placement with Separation Constraints) has been moved to src/libvpsc and the actual graph layout algorithm is in libcola. (bzr r1394) 
implemented in Boost.  I am replacing this with a custom implementation of
a constrained stress-majorization algorithm.

The stress-majorization algorithm is more robust and has better convergence
characteristics than Kamada-Kawai, and also simple constraints can be placed
on node position (for example, to enforce downward-pointing edges, non-overlap constraints, or cluster constraints).

Another big advantage is that we no longer need Boost.

I've tested the basic functionality, but I have yet to properly handle
disconnected graphs or to properly scale the resulting layout.

This commit also includes significant refactoring... the quadratic program solver - libvpsc (Variable Placement with Separation Constraints) has been moved to src/libvpsc and the actual graph layout algorithm is in libcola.

(bzr r1394)