From 12b21e1d27f43deaa748419919b40b80cedd0ddd Mon Sep 17 00:00:00 2001 From: Tim Dwyer Date: Wed, 12 Jul 2006 00:55:58 +0000 Subject: Previously graph layout was done using the Kamada-Kawai layout algorithm 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) --- src/Makefile_insert | 2 ++ 1 file changed, 2 insertions(+) (limited to 'src/Makefile_insert') diff --git a/src/Makefile_insert b/src/Makefile_insert index 4b797f233..b136a55e6 100644 --- a/src/Makefile_insert +++ b/src/Makefile_insert @@ -279,6 +279,8 @@ inkscape_private_libs = \ ui/widget/libuiwidget.a \ graphlayout/libgraphlayout.a \ removeoverlap/libremoveoverlap.a \ + libcola/libcola.a \ + libvpsc/libvpsc.a \ extension/libextension.a \ extension/implementation/libimplementation.a \ extension/internal/libinternal.a \ -- cgit v1.2.3