Does anybody know if there is any software (or even an algorithm...) to straighten out a network graph like the galaxy map? I mean something that would take a list of nodes and edges and give you back a picture of the graph optimized for the shortest/cleanest paths with no overlaps.
There was an online game I was playing a few years ago (Planarity:
www.planarity.net) where you basically do this as a puzzle: the game will give you more and more complex graphs and you had to rearrange them so there were no overlapping edges. I wasn't very good at it and would like to automate the solution this time around!