| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Put adaptagrams into its own folder | Marc Jeanmougin | 2018-04-29 | 1 | -137/+0 |
| | | |||||
| * | Updated libs from the Adaptagrams project: libavoid, libcola and libvspc; ↵ | Sylvain Chiron | 2017-07-01 | 1 | -51/+73 |
| | | | | | | | changed the code to match the new API Signed-off-by: Sylvain Chiron <chironsylvain@orange.fr> | ||||
| * | fixed warnings | Tim Dwyer | 2006-07-14 | 1 | -0/+2 |
| | | | | (bzr r1410) | ||||
| * | - added toggle buttons for directed layout (doesn't do anything yet) and ↵ | Tim Dwyer | 2006-07-12 | 1 | -2/+2 |
| | | | | | | | | | overlap avoiding layout to connector toolbar - added icon for directed layout toggle button - removed old ref to remove_rectangle_overlaps-test from src/Makefile.am (bzr r1396) | ||||
| * | Previously graph layout was done using the Kamada-Kawai layout algorithm | Tim Dwyer | 2006-07-12 | 1 | -0/+113 |
| 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) | |||||
