I have a bunch of nodes and edges and need to make a decent human readable map out of them. Does anyone know of an algorithm that will map the nodes in such a way edge overlap is minimized? Map as in I can print the result with the nodes emphasized and minimal edge crossing.
Currently going through Skiena's Algorithm Design, which by the way is a fricken excellent book on algorithms (examples are in C for my edition, the concepts carry, wish I'd found it 30 years ago but as it's 20 years old, well...), not finding what I need.
In other words, the input is a node followed by a list of nodes it connects to. Don't read too much into that example, I pulled it out of my hat. But as you can see from node 12 it's common for 2 or more nodes to connect to an unknown node.
Be careful when following the masses, sometimes the m is silent.