summaryrefslogtreecommitdiffstats
path: root/src/libcola/gradient_projection.h (unfollow)
Commit message (Collapse)AuthorFilesLines
2018-04-29Put adaptagrams into its own folderMarc Jeanmougin1-165/+0
2017-07-01Updated libs from the Adaptagrams project: libavoid, libcola and libvspc; ↵Sylvain Chiron1-253/+135
changed the code to match the new API Signed-off-by: Sylvain Chiron <chironsylvain@orange.fr>
2013-10-16cppcheck initialisationKris De Gussem1-2/+21
(bzr r12697)
2013-10-07cppcheckKris De Gussem1-1/+1
(bzr r12669)
2011-10-18cppcheckKris De Gussem1-1/+1
(bzr r10681)
2011-06-27Remove "using namespace" from libcola headers.Jon A. Cruz1-23/+21
(bzr r10374)
2007-11-04Add virtual to a lot of the destructors. Note: perhaps it will have to be ↵Johan B. C. Engelen1-1/+1
reverted for some files to keep them C-compatible. (bzr r4024)
2006-07-14- Connectors with end-markers now constrained to point downwards in graph layoutTim Dwyer1-24/+24
- vpsc namespace added to libvpsc (bzr r1408)
2006-07-12Previously graph layout was done using the Kamada-Kawai layout algorithm Tim Dwyer1-0/+266
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)