Graph Layout for Displaying Data Structures

  • Vance Waddle
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1984)

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.

References

  1. 1.
    K.-F. Boehringer, and F. N. Paulisch Using Constraints to Achieve Stability in Automatic Graph Layout Algorithms, ACM CHI’ 90 Proceedings, pp. 43–51.Google Scholar
  2. 2.
    A. Borning, The Programming Language Aspects of ThingLab, a Constraint-Oriented Simulation Laboratory, ACM Transactions on Programming Languages and Systems, 3(4), pp. 252–387, 1981.CrossRefGoogle Scholar
  3. 3.
    G. D. Battista, P. Eades, R. Tomassia, and I. G. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs, Prentice Hall, 1999.Google Scholar
  4. 4.
    P. Eades and D. Kelly, Heuristics for Reducing Crossings in 2-Layered Networks, Ars Combin., 21.A, 89–98, 1986.MathSciNetGoogle Scholar
  5. 5.
    P. Eades, W. Lai, K. Misue, and K. Sugiyama, Preserving the Mental Map of a Diagram, Proceedings Compugraphics’ 91, pp. 24–33, 1991.Google Scholar
  6. 6.
    E.R. Gansner, E. Koutsofios, S.C. North and K.-P. Vo, A Technique for Drawing Directed Graphs, IEEE Transactions on Software Engineering, Vol. 19, No. 3. 1993.Google Scholar
  7. 7.
    W. He and K. Marriott, Constrained Graph Layout, Proceedings of Graph Drawing GD’96, pp. 217–232, Springer, 1996.Google Scholar
  8. 8.
    T. Kamps, J. Kleinz, and J. Read, Constraint-Based Sping-Model for Graph Layout, Proceedings of Graph Drawing GD’ 95, pp. 349–360, Springer.Google Scholar
  9. 9.
    C. Kosak, J. Marks, and S. Shieber, Automating the Layout of Network Diagrams with Specified Visual Organization, IEEE Transactions on Systems, Man, and Cybernetics, Vol. 24, No. 3, pp. 440–454.Google Scholar
  10. 10.
    D. E. Knuth, The Art of Computer Programming, Vol 1: Fundamental Algorithms, Second Edition, Addison-Wesley, 1973.Google Scholar
  11. 11.
    D. E. Knuth, The Art of Computer Programming, Vol 3: Sorting and Searching, Addison-Wesley, 1973.Google Scholar
  12. 12.
    J. Korn, A. W. Appel, Traversal-based Visualization of Data Structures, IEEE Symposium on Information Visualization (InfoVis’ 98), pp 11–18.Google Scholar
  13. 13.
    B. Myers, INCENSE: A System for Displaying Data Structures, Proc. SIGGRAPH 1983, pp. 115–125.Google Scholar
  14. 14.
    S.C. North, Incremental Layout in DynaDAG, Proc. of Graph Drawing GD’ 95, pp. 409–418, Springer.Google Scholar
  15. 15.
    S.C. North and E. Koutsofios, Applications of Graph Visualization, Graphics Interface’ 94, pp. 235–245.Google Scholar
  16. 16.
    S.P. Reiss, The Field Programming Environment: A Friendly Integrated Environment for Learning and Development, Kluwer, 1995.Google Scholar
  17. 17.
    K. Ryall, J. Marks, and S. Shieber, An Interactive System for Drawing Graphs, Proc. Graph Drawing GD’ 96, pp. 387–393, Springer.Google Scholar
  18. 18.
    Jochem Seeman, Extending the Sugiyama Algorithm for Drawing UML Class Diagrams: Towards Automatic Layout of Object-Oriented Software Diagrams, pp. 415–427, Proc. Graph Drawing’ 97, Giuseppe DiBattista, ed. Springer.Google Scholar
  19. 19.
    T. Shimomura and S. Isoda, Linked-List Visualization for Debugging, IEEE Software, Vol. 8, No. 3, pp. 44–51, May 1991.CrossRefGoogle Scholar
  20. 20.
    Sugiyama, K., Tagawa, S., and M. Toda, Methods for Visual Understanding of Hierarchical Structures, IEEE Transactions on Systems, Man, and Cybernetics, Vol. SMC-11, No. 2. Feb. 1981.Google Scholar
  21. 21.
    K. Sugiyama and K. Misue, Visualization of Structural Information: Automatic Drawing of Compound Digraphs, IEEE Transactions on Systems, Man, and Cybernetics, Vol 21, No. 4, pp. 876–892, July/August, 1991.CrossRefMathSciNetGoogle Scholar
  22. 22.
    V. Waddle, A Sugiyama-Style Layout Algorithm for Nonhierarchical, Leveled Graphs, in preparation.Google Scholar
  23. 23.
    V. Waddle, and A. Malhotra, An E log E Line Crossing Algorithm for Leveled Graphs, Proc. of Graph Draw GD’ 99, pp. 59–71, Springer.Google Scholar
  24. 24.
    J. Yang, C.A. Shaffer, and L. S. Heath, SWAN: A Data Structure Visualization System, Proc. of Graph Drawing GD’ 95, pp 520–523.Google Scholar
  25. 25.
    A. Zeller and D. Luetkeaus, DDD-A Free Graphical Front-end for UNIX Debuggers, SIGPLAN Notices, 31(1):22–27, January 1996.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Vance Waddle
    • 1
  1. 1.IBM Thomas J. Watson Research Center

Personalised recommendations