Drawing Directed Acyclic Graphs: Using DAG property to improve layout/edge routing?

Posted by Robert Fraser on Stack Overflow See other posts from Stack Overflow or by Robert Fraser
Published on 2010-05-17T21:47:26Z Indexed on 2010/05/17 21:50 UTC
Read the original article Hit count: 211

Hi,

Laying out the verticies in a DAG in a tree form (i.e. verticies with no in-edges on top, verticies dependent only on those on the next level, etc.) is rather simple. However, is there a simple algorithm to do this that minimizes edge crossing? (For some graphs, it may be impossible to completely eliminate edge crossing.) A picture says a thousand words, so is there an algorithm that would suggest:

No edge crossing

instead of:

Serious edge crossing

© Stack Overflow or respective owner

Related posts about graph-drawing

Related posts about graph