[wd40bomber7]

By graphs I mean these graphs. That is, graphs that are composed of nodes and links betweent he nodes.

I am looking for an algorithm which will, given a list of nodes and connections between them, find the optimal (or an optimal) way to display the nodes and connections.

I define optimal as:
1. The fewest number of links crossing on top of each other
2. The closest (to a set minimum) length of each link between the nodes
3. The most compact representation of the graph

Anyone have any idea were I might find an algorithm that is capable of these things?

[Skydiver]

If you can buy or borrow a copy of "The Algorithm Design Manual", the appendix covers this problem and some recommended algorithms, common solutions, as well as some packages whose source code you can link into your code. http://www.amazon.co...a/dp/0387948600