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/libcola/Makefile_insert | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 src/libcola/Makefile_insert (limited to 'src/libcola/Makefile_insert') diff --git a/src/libcola/Makefile_insert b/src/libcola/Makefile_insert new file mode 100644 index 000000000..f8f9de20c --- /dev/null +++ b/src/libcola/Makefile_insert @@ -0,0 +1,17 @@ +## Makefile.am fragment sourced by src/Makefile.am. + +libcola/all: libcola.a + +libcola/clean: + rm -f libcola/libcola.a $(libcola_libcola_a_OBJECTS) + +libcola_libcola_a_SOURCES = libcola/cola.h\ + libcola/cola.cpp\ + libcola/conjugate_gradient.cpp\ + libcola/conjugate_gradient.h\ + libcola/gradient_projection.cpp\ + libcola/gradient_projection.h\ + libcola/shortest_paths.cpp\ + libcola/shortest_paths.h\ + libcola/straightener.h\ + libcola/straightener.cpp -- cgit v1.2.3