summaryrefslogtreecommitdiffstats
path: root/src/libvpsc (follow)
Commit message (Collapse)AuthorAgeFilesLines
* Cmake: more fixs for C internal libsJoshua L. Blocher2008-04-071-0/+11
| | | (bzr r5358)
* Applying fixes for gcc 4.3 build issues (closes LP: #169115)Bryce Harrington2008-01-312-0/+2
| | | (bzr r4629)
* Add virtual to a lot of the destructors. Note: perhaps it will have to be ↵Johan B. C. Engelen2007-11-045-5/+5
| | | | | reverted for some files to keep them C-compatible. (bzr r4024)
* drop more missing files from autoconfKees Cook2007-03-221-1/+0
| | | (bzr r2734)
* commited Solaris 2.8 / gcc-3.2.3 fixesMarkus Schwarzenberg2007-03-011-57/+0
| | | (bzr r2485)
* cleanup, remove warningsTim Dwyer2006-07-171-1/+1
| | | (bzr r1429)
* minor performance improvementTim Dwyer2006-07-171-2/+3
| | | (bzr r1428)
* fixed warningsTim Dwyer2006-07-141-11/+10
| | | (bzr r1410)
* - Connectors with end-markers now constrained to point downwards in graph layoutTim Dwyer2006-07-1416-62/+110
| | | | | - vpsc namespace added to libvpsc (bzr r1408)
* Previously graph layout was done using the Kamada-Kawai layout algorithm Tim Dwyer2006-07-1224-0/+3184
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)