|
Boost Users : |
From: Doug Gregor (dgregor_at_[hidden])
Date: 2004-08-17 13:25:34
On Aug 17, 2004, at 9:33 AM, Gordon Smith wrote:
> Just playing with the kamada_kawai_spring_layout , so far for any non
> trivial graph (more then 4 nodes) - it seems to just go into an
> infinite
> loop. The graph is undirected but would contain "circular" paths -
> thoughts?
I'm quite sure I botched the default termination condition. You could,
if you are interested, try writing your own termination condition to
see the behavior of the "delta" parameter and why my simple
minimum-finding code doesn't work. Or you could send me one of those
graphs and I can do the same.
Doug
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net