Advertisement

The Unbounded Undirected Graph

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

Abstract

This chapter concludes the graph abstraction implementations with the unbounded undirected graph. §12.1 provides the interface to the abstract data type, and its implementation follows in §12.2.

Keywords

Edge Node Loop Index Undirected Edge Graph Object Vertex Label 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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 1985Google Scholar

Copyright information

© Springer-Verlag New York Inc. 1989

Authors and Affiliations

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

Personalised recommendations