Displaying a program’s data structures as a graph is a valuable addition to debuggers, however, previous papers have not discussed
the layout issues specific to displaying data structures. We find that the semantics of data structures may require constraining
node and edge path orderings, and that nonhierarchical, leveled graphs are the preferred data structure display. We describe
layout problems for data structures, and extend the Sugiyama algorithm to solve them.