I've got a system with multiple nodes which one-way communicate to other nodes. I want to diagram the node system in as simple way as possible; if the node-communication is represented by an arrow from the source node to the target node, that would mean the diagram would be one that contains as few crossing arrows as possible.
Assuming a grid-like layout of the nodes, brute-force computation through all the permutations of the nodes on a grid quickly gets out of hand. Can anyone point me in the right direction as to how this problem can be solved efficiently?