We present an algorithm for drawing directed graphs, which is based on rapidly solving a sequence of three one-dimensional optimization problems. The algorithm can be directly applied to cyclic or acyclic digraphs. It does not require such preprocessing as inverting edge directions or introducing dummy nodes. We also derive a hierarchy index from the input digraph, which quantitatively measures its amount of hierarchy.
10th International Symposium on Graph Drawing