| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Put adaptagrams into its own folder | Marc Jeanmougin | 2018-04-29 | 1 | -139/+0 |
| | | |||||
| * | Updated libs from the Adaptagrams project: libavoid, libcola and libvspc; ↵ | Sylvain Chiron | 2017-07-01 | 1 | -42/+119 |
| | | | | | | | changed the code to match the new API Signed-off-by: Sylvain Chiron <chironsylvain@orange.fr> | ||||
| * | Documentation update pass. | Jon A. Cruz | 2011-10-23 | 1 | -4/+6 |
| | | | | (bzr r10692) | ||||
| * | Add virtual to a lot of the destructors. Note: perhaps it will have to be ↵ | Johan B. C. Engelen | 2007-11-04 | 1 | -1/+1 |
| | | | | | | reverted for some files to keep them C-compatible. (bzr r4024) | ||||
| * | - Connectors with end-markers now constrained to point downwards in graph layout | Tim Dwyer | 2006-07-14 | 1 | -0/+2 |
| | | | | | | - vpsc namespace added to libvpsc (bzr r1408) | ||||
| * | Previously graph layout was done using the Kamada-Kawai layout algorithm | Tim Dwyer | 2006-07-12 | 1 | -0/+58 |
| 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) | |||||
