| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | remove files that interface through C with libvpsc, we are using C++ so... | Johan B. C. Engelen | 2014-03-23 | 1 | -128/+0 |
| | | | | (bzr r13191) | ||||
| * | better fix | Kris De Gussem | 2012-09-09 | 1 | -1/+2 |
| | | | | (bzr r11659) | ||||
| * | static code checking (fixes Bug #614227 ) | Kris De Gussem | 2012-09-09 | 1 | -59/+60 |
| | | | | (bzr r11658) | ||||
| * | Fixing more broken and split doc comments. | Jon A. Cruz | 2011-10-27 | 1 | -2/+2 |
| | | | | (bzr r10697) | ||||
| * | Applying fixes for gcc 4.3 build issues (closes LP: #169115) | Bryce Harrington | 2008-01-31 | 1 | -0/+1 |
| | | | | (bzr r4629) | ||||
| * | - Connectors with end-markers now constrained to point downwards in graph layout | Tim Dwyer | 2006-07-14 | 1 | -9/+10 |
| | | | | | | - 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/+124 |
| 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) | |||||
