Knuthian Drawings of Series-Parallel Flowcharts

08/17/2015

∙

by   Michael T. Goodrich, et al.

∙

0

∙

share

Inspired by a classic paper by Knuth, we revisit the problem of drawing flowcharts of loop-free algorithms, that is, degree-three series-parallel digraphs. Our drawing algorithms show that it is possible to produce Knuthian drawings of degree-three series-parallel digraphs with good aspect ratios and small numbers of edge bends.