Graph Layout for Displaying Data Structures

Waddle, Vance (2001) Graph Layout for Displaying Data Structures. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000 , pp. 241-252(Official URL: http://dx.doi.org/10.1007/3-540-44541-2_23).

Full text not available from this repository.

Abstract

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.

Item Type:	Conference Paper
Additional Information:	10.1007/3-540-44541-2_23
Classifications:	M Methods > M.500 Layered J Applications > J.999 Others P Styles > P.480 Layered
URI:	http://gdea.informatik.uni-koeln.de/id/eprint/366

Actions (login required)

View Item