Skip to main content
SpringerLink
Log in

Algorithm visualization using tree graphs

  • Short Communication
  • Published:
The Visual Computer Aims and scope Submit manuscript

Abstract

Recent advances in graphics workstations allow the development of improved visualization tools for algorithm and program development. Algorithm visualization permits better analysis, development, and presentation of the algorithm characteristics. In this paper, we present a simple algorithm visualization technique using tree graphs. The technique is applied to the visualization of three sorting algorithms: the bubble sort, the quicksort, and the merge and sort, and one matrix algorithm, the Gaussian elimination. Key states of the data are displayed on the nodes, while the graph itself represents the underlying structure of the algorithm. All graphics are displayed under the X Window environment using simple graphics and window programming techniques.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  • Bentley J, Kernighan B (1987) A system for algorithm animation. Tutorial and user manual, AT & T Bell Labs Tech Report No 132

  • Brown M (1988) Exploring algorithms using Balsa-II. IEEE Computer 21:14–36

    Google Scholar 

  • Brown M, Sedgewick R (1985) Techniques for algorithm animation. IEEE Software, pp 28–39

  • Hsia Y, Ambler A (1988) Construction and manipulation of dynamic icons, 1988. Workshop on Visual Languages, Pittsburgh, pp 78–83

  • Kelley A, Pohl I (1984) A book on C: an introduction to programming in C. Benjamin/Cummings, Menlo Park, Calif

  • Knuth DE (1973) The art of computer programming, vol 3: Sorting and searching. Addison Wesley, Reading, Mass

    Google Scholar 

  • London R, Duisberg R (1985) Animating programs using Smalltalk. IEEE Computer 18:61–71

    Google Scholar 

  • Roman G, Cox K (1989) A declarative approach to visualizing concurrent computations. IEEE Computer 22:25–36

    Google Scholar 

  • Sedgewick R (1983) Algorithms, chap 5. Addison Wesley, Reading, Mass

    Google Scholar 

  • Tuchman A, Berry M (1989) Matrix visualization in the design of numerical algorithms. CSRD Tech Report No 826

  • Young D (1990) X Window system. Programming and applications with Xt. OSF/MOTIF Edition. Prentice Hall, Englewood Cliffs, NI

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Hewlett-Packard Laboratories, Building 3U, P.O. Box 10490, 94303, Palo Alto, CA, USA

    Konstantinos Konstantinides

Authors
  1. Konstantinos Konstantinides
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Konstantinides, K. Algorithm visualization using tree graphs. The Visual Computer 7, 220–228 (1991). https://doi.org/10.1007/BF01900838

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01900838

Key words

Search

Navigation