summaryrefslogtreecommitdiffstats
path: root/src/removeoverlap/pairingheap (unfollow)
Commit message (Collapse)AuthorFilesLines
2006-07-12Previously graph layout was done using the Kamada-Kawai layout algorithm Tim Dwyer4-466/+0
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)
2006-02-22Fixed template warning.Tim Dwyer1-9/+11
(bzr r173)
2006-02-21introduce orthogonal template declaration, fixes compiler warningsRalf Stephan1-2/+5
(bzr r172)
2006-02-06Had to include fstream for overloaded def of <<Tim Dwyer1-0/+1
(bzr r91)
2006-02-06DBL_MIN replaced by -DBL_MAX which is what I meant all along.Tim Dwyer2-2/+28
Fixes bug. (bzr r89)
2006-02-01Added consts to args of pairing heap compare fnTim Dwyer2-4/+4
(bzr r64)
2006-01-26Fixed bug to do with comparison of invalid constraints in pairing heaps.Tim Dwyer1-1/+1
Also numerical problem with constraint generation fixed. (bzr r30)