0

I have an acyclic graph - a tree.

Each node of the graph will have some attributes that I need to show in a glyph.

Let's us say the size of each Glyph is 100x100 pixels.

I am looking for an algorithm that is fast and efficient for up to 100,000 nodes that will lay out the nodes in xy space.

Improve this question

1 Answer 1

Reset to default
2

JUNG has a few different layout algorithms for trees that should work fine: TreeLayout, obviously, but you might also look at RadialTreeLayout and BalloonLayout.

http://jung.sourceforge.net/doc/api/edu/uci/ics/jung/algorithms/layout/package-summary.html

Improve this answer
Sign up to request clarification or add additional context in comments.

Comments

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.