The Unbounded Directed Graph

  • Charles Lins
Part of the Springer Compass International book series (COMPASS)


In this chapter the first of two implementations of the directed graph abstraction described in the previous chapter is presented. In § 10.1 the standard operations and exceptions module used by all graph modules in this volume is presented. The interface to the unbounded directed graph follows in §10.2; the chapter concludes with the implementation in §10.3.


Directed Edge Edge Node Initial Vertex Loop Index Exception Handler 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    A. V. Aho, J. E. Hopcroft, and J. D. Ullman, Data Structures and Algorithms, Addison-Wesley, Reading, MA 1983.MATHGoogle Scholar
  2. [2]
    G. Booch, Software Components with Ada Structures, Tools, and Subsystems, Benjamin/Cummings, Menlo Park, CA 1987.Google Scholar
  3. [3]
    K. Mehlhorn, Data Structures and Algorithms 2: Graph Algorithms and NP- Completeness, Springer-Verlag, Berlin Heidelberg, 1984.MATHGoogle Scholar
  4. [4]
    R. Sedgewick, Algorithms, Addison-Wesley, Reading, MA 1983.MATHGoogle Scholar
  5. [5]
    A. M. Tenenbaum and M. J. Augenstein, Data Structures Using Pascal, Prentice- Hall, Englewood Cliffs, NJ 1981.MATHGoogle Scholar
  6. [6]
    N. Wirth, Programming in Modula-2, 3rd corrected edition, Springer-Verlag, New York, NY 1985MATHGoogle Scholar

Copyright information

© Springer-Verlag New York Inc. 1989

Authors and Affiliations

  • Charles Lins
    • 1
  1. 1.Apple Computer, Inc.CupertinoUSA

Personalised recommendations