Graph layout through the VCG tool

Extended abstract and system demonstration
  • Georg Sander
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 894)

Abstract

The VCG tool allows to visualize graphs that occur typically as data structures in programs. We describe the functionality of the VCG tool, its layout algorithm and its heuristics. Our main emphasis in the selection of methods is to achieve a very good performance for the layout of large graphs. The tool supports the partitioning of edges and nodes into edge classes and nested subgraphs, the folding of regions, and the management of priorities of edges. The algorithm produces good drawings and runs reasonably fast even on very large graphs.

References

  1. [1]
    Alt, M.; Aßmann, U; Someren, H: Cosy Compiler Phase Embedding with the CoSy Compiler Model, in Fritzson, P.A.: Compiler Construction, 5th International Conference, CC '94, Proceedings, Lecture Notes in Computer Science 786, pp. 278–293, Springer Verlag 1994Google Scholar
  2. [2]
    Battista, G.D.; Eades, P.; Tamassia, R.: Algorithms for Drawing Graphs: An Annotated Bibliography, avail. ftp at wilma.cs.brown.edu, /pub/gdbiblio.tex 1993; a prev. version was avail. as technical report CS-89-09, Brown University, Department of Computer Science, Providence RI, Oct. 1989Google Scholar
  3. [3]
    Bentley, J.L.; Ottmann, T.A.: Algorithms for Reporting and Counting Geometric Intersections, IEEE Trans. on Computers, Vol. C 28, No. 9, pp. 643–647, 1979Google Scholar
  4. [4]
    Brandenburg, F.J.: Nice Drawings of Graphs are Computationally Hard, Visualization in Human Computer Interaction, Lecture Notes in Computer Science 439, pp. 1–15, Springer Verlag 1990Google Scholar
  5. [5]
    Eades, P.; Wormald N.: The median heuristic for drawing 2-layers networks, technical report 69, Department of Computer Science, University of Queensland, 1986Google Scholar
  6. [6]
    Eades, P.; McKay B.; Wormald N.: On an edge crossing problem, Proc. 9th Australian Computer Science Conf., pp. 327–334, 1986Google Scholar
  7. [7]
    Fruchterman, T.M.J.; Reingold, E.M.: Graph drawing by forcedirected placement, Software — Practice and Experience, Vol. 21, pp. 1129–1164, 1991Google Scholar
  8. [8]
    Gansner, E.R.; Koutsofios, E.; North, S.C.; Vo, K.: A Technique for Drawing Directed Graphs, IEEE Trans. on Software Engineering, Vol. 19, No. 3, pp. 214–230, March, 1993Google Scholar
  9. [9]
    Heckmann, R.; Sander, G.: TrafoLa-H Reference Manual, in Hoffmann, Berthold; Krieg-Brückner, Bernd, Editors: Program Development by Specification and Transformation, Lecture Notes in Computer Science 680, Springer Verlag 1993Google Scholar
  10. [10]
    Kamada, T.; Kawai, S.: An algorithm for drawing general undirected graphs, Information Processing Letters 31, pp. 7–15, 1989Google Scholar
  11. [11]
    Lemke, I: Entwicklung und Implementierung eines Visualisierungswerkzeuges für Anwendungen im Übersetzerbau, Universität des Saarlandes, Saarbrücken, Germany, Fachbereich 14 Informatik, (to appear, in German) 1994Google Scholar
  12. [12]
    Paulisch, F.N.; Tichy, W.F.: EDGE: An Extendible Graph Editor, Software —Practice and Experience, Vol. 20, No. S1, pp. 63–88, June 1990Google Scholar
  13. [13]
    Sugiyama, K.; Tagawa, S.; Toda, M.: Methods for visual understanding of hierarchical system structures, IEEE Trans. on Systems, Man, and Cybernetics SMC-11, No. 2, pp. 109–125, Feb. 1981Google Scholar
  14. [14]
    Warfield, N.J.: Crossing theory and hierarchy mapping, IEEE Trans. on Systems, Man, and Cybernetics SMC-7, No. 7, pp. 505–523, Feb. 1977Google Scholar
  15. [15]
    Wilhelm, Reinhard; Maurer, Dieter: Übersetzerbau: Theory, Konstruktion, Generierung, Springer Verlag 1992, English Version to appear with Addison Wesley Google Scholar

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • Georg Sander
    • 1
  1. 1.Universität des SaarlandesSaarbrücken

Personalised recommendations