This Bugzilla instance is a read-only archive of historic NetBeans bug reports. To report a bug in NetBeans please follow the project's instructions for reporting issues.
Background: Currently there are limited set of Routing Algorithms (Edges Layouts) available to graph users. The current set of layouts seem to cause performance problems when using the GraphPinScene (Nodes with Edges). The problem seems to stem from the RouterFactory.createOrthogonalRouter(). If there are more than 20 nodes and edges ( yes even the sum of them ), the validating of the graph can be extremely slow. Right now, if there are over 20 nodes and their edges I switch to direct routing which is an eye-sore for the user. Needed: Better Algorithms for Routing
Created attachment 61446 [details] Shows import still need though there are already two imports.
Ignore last attachment. Attached to the wrong bug. What is the current status of this anyway?
Just curious, what is the status of this?