neilcsmith-net commented on code in PR #8217:
URL: https://github.com/apache/netbeans/pull/8217#discussion_r1938251292
##########
java/java.graph/src/org/netbeans/modules/java/graph/FruchtermanReingoldLayout.java:
##########
@@ -150,7 +150,7 @@ private void init() {
bounds = new Rectangle(magicSizeConstant + (magicSizeMultiplier *
nds),
magicSizeConstant + (magicSizeMultiplier *
nds)); //g.getMaximumBounds();
temp = bounds.getWidth() / 10;
- forceConstant = 0.75 * Math.sqrt(bounds.getHeight() *
bounds.getWidth() / nds);
+ forceConstant = 1.75 * Math.sqrt(bounds.getHeight() *
bounds.getWidth() / nds);
Review Comment:
It seems to make little different with a smaller graph, but with the larger
projects I tested (that had the infinite loop before) it's much better and
makes them somewhat useful. I suspect it's mitigating some of the problems
with the reduced search for free space, but as that never completes to compare
it with, it's a little hard to know for sure.
--
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.
To unsubscribe, e-mail: notifications-unsubscr...@netbeans.apache.org
For queries about this service, please contact Infrastructure at:
us...@infra.apache.org
---------------------------------------------------------------------
To unsubscribe, e-mail: notifications-unsubscr...@netbeans.apache.org
For additional commands, e-mail: notifications-h...@netbeans.apache.org
For further information about the NetBeans mailing lists, visit:
https://cwiki.apache.org/confluence/display/NETBEANS/Mailing+lists
