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.

Bug 123087 - Better Alogrithms for Routing
Summary: Better Alogrithms for Routing
Status: NEW
Alias: None
Product: platform
Classification: Unclassified
Component: Graph (show other bugs)
Version: 3.x
Hardware: All All
: P2 blocker with 1 vote (vote)
Assignee: issues@platform
Depends on:
Reported: 2007-11-29 19:37 UTC by Joelle Lam
Modified: 2008-07-29 02:51 UTC (History)
0 users

See Also:
Exception Reporter:

Shows import still need though there are already two imports. (49.04 KB, image/png)
2008-05-15 19:54 UTC, Joelle Lam

Note You need to log in before you can comment on or make changes to this bug.
Description Joelle Lam 2007-11-29 19:37:01 UTC
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
Comment 1 Joelle Lam 2008-05-15 19:54:59 UTC
Created attachment 61446 [details]
Shows import still need though there are already two imports.
Comment 2 Joelle Lam 2008-05-15 19:56:51 UTC
Ignore last attachment.  Attached to the wrong bug.  What is the current status of this anyway?
Comment 3 Joelle Lam 2008-07-29 02:51:20 UTC
Just curious, what is the status of this?