summaryrefslogtreecommitdiffstats
path: root/src/libcola/cola.h (follow)
Commit message (Collapse)AuthorAgeFilesLines
* cleanup, remove warningsTim Dwyer2006-07-171-50/+3
| | | (bzr r1429)
* remove overlaps between connected componentsTim Dwyer2006-07-171-15/+19
| | | (bzr r1425)
* Constraints are now properly divided up between the connected componentsTim Dwyer2006-07-171-2/+13
| | | (bzr r1424)
* Layout algorithm is now applied to each connected component in the Tim Dwyer2006-07-161-3/+18
| | | | | | selection separately. Previously, behaviour of layout on disconnected graphs was... undefined! (bzr r1421)
* - Connectors with end-markers now constrained to point downwards in graph layoutTim Dwyer2006-07-141-3/+3
| | | | | - vpsc namespace added to libvpsc (bzr r1408)
* Previously graph layout was done using the Kamada-Kawai layout algorithm Tim Dwyer2006-07-121-0/+242
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)