title: Algorithm for schematizing (metro) maps
body: <p>This is a long shot, but I thought I might try before starting the dirty work.</p>
  
  <p>I've got a project to build an application which will, for a defined input stations (vertices) and lines (edges), that is, a real map of some public transportation, schematize a given map into a metro map. I've done some research on the problem and it's an NP-complete problem equivalent to the 3-SAT problem. I also have some theoretic ideas on how to generate such a map, but they aren't detailed enough.</p>
  
  <p>What I'm looking for is any other existing solution of this problem, some sort of pseudo-code, some real code in (almost) any other programming language etc, anything that would reduce the time I need to spend working on the algorithm itself, which will in return give me more time to work on other aspects of the application.</p>
  
  <p>If anyone has ever seen anything that can help me, I'd appreciate it very much.</p>