17 Aug
2004
17 Aug
'04
6:25 p.m.
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