| Commit message (Collapse) | Author | Age | Files | Lines |
| |
|
| |
(bzr r1429)
|
| |
|
| |
(bzr r1428)
|
| |
|
| |
(bzr r1426)
|
| |
|
| |
(bzr r1425)
|
| |
|
| |
(bzr r1424)
|
| |
|
|
|
|
| |
selection separately. Previously, behaviour of layout on disconnected
graphs was... undefined!
(bzr r1421)
|
| |
|
| |
(bzr r1410)
|
| |
|
|
|
| |
- vpsc namespace added to libvpsc
(bzr r1408)
|
| |
|
|
|
|
|
|
| |
overlap avoiding layout to connector toolbar
- added icon for directed layout toggle button
- removed old ref to remove_rectangle_overlaps-test from src/Makefile.am
(bzr r1396)
|
|
|
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)
|