inkscape/src/libcola/Makefile_insert, branch livecoding An experimental livecoding plugin for Inkscape Remove deprecated Autotools and btool files. Please use CMake instead 2016-08-08T12:56:40+00:00 Alex Valavanis valavanisalex@gmail.com 2016-08-08T12:56:40+00:00 e471a664f923f517b68071f2e33fbb6ce070f8b7 (bzr r15046) 
(bzr r15046)
 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)