Algorithm for perfect non-binary graph layout

Posted by mariki on Programmers See other posts from Programmers or by mariki
Published on 2012-03-16T13:30:50Z Indexed on 2012/03/19 2:15 UTC
Read the original article Hit count: 289

Filed under:
|
|

I have a complex non-binary graph model.
Each tree node can have multiple children&parents (a node can also have a connection to it's "brother").

A node is represented as square on screen with lines to the connected nodes.
For that I want to use Draw2D and GEF libraries.

The problem I am facing is the graph layout.

I need a nice algorithm that can reposition the square nodes and the connections with minimum intersections and also make it symmetric as possible.

© Programmers or respective owner

Related posts about java

Related posts about algorithms