グラフ内のクロスエッジを最小限に抑えます

Question

NetworkX（Python Graph-drawing package）を使用しています http://networkx.lanl.gov/index.html

Answer 1

Determining a planar graph layout which minimizes the number of crossings is NP-Hard. See the wiki page on Crossing Number.

You could try some heuristics, force based layout are quite popular I believe (graphviz uses them, if I recollect correctly).

You could also try some approximation algorithms, you should find references on the wiki page I linked.

Hope that helps.