Post reply

Warning: this topic has not been posted in for at least 120 days.
Unless you're sure you want to reply, please consider starting a new topic.

Note: this post will not display until it's been approved by a moderator.

Name:
Email:
Subject:
Message icon:

shortcuts: hit alt+s to submit/post or alt+p to preview

Please read the rules before you post!


Topic Summary

Posted by: Narmio
« on: August 02, 2013, 01:14:40 PM »

Your best bet is probably "neato", part of the graphviz package designed to use spring-and-mass based algorithms to nicely lay out undirected graphs.  You can find graphviz at graphviz.org and there's instructions for using neato here: http://www.graphviz.org/pdf/neatoguide.pdf .  You'd need to get the map out into a .dot format, which might take a bit of work, but once you have that working neato will make things easy.
Posted by: joeclark77
« on: August 01, 2013, 11:06:01 PM »

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!