Planar Graph Layouts
For general graphs, the problem of a determining a planar layout of a graph with least edges crossing (the Crossing Number) is NP-hard. So some heuristic methods are used (like the Force based layout algorithms). The page below briefly describes the graphviz algorithms and suggests some ways to use them for benefit. It also has … Read more