| Commit message (Collapse) | Author | Age | Files | Lines |
|---|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
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)
|
| |
|
|
|
|
|
|
| |
I can't reproduce the problem, however solve_VPSC code in inkscape
was getting quite out of date with that in www.sf.net/projects/adaptagrams.
I've updated the code, which may fix the problem, or at least if it's
reported again then I'll know it's still an issue.
(bzr r803)
|
| |
|
|
|
|
|
| |
Okay, I'm basically undoing the last commit that SVK screwed up. All
this work is not mine, it was done by other people. Sorry to mess
things up.
(bzr r92)
|
| | |
|
| |
|
| |
(bzr r84)
|
| |
|
| |
(bzr r32)
|
| |
|
|
|
| |
Also numerical problem with constraint generation fixed.
(bzr r30)
|
|
|
(bzr r1)
|
