Skip to main content

A Simple Graph Package Providing an Iterator

  • Chapter
Book cover Studies in Ada® Style

Abstract

Graphs are an important data structure throughout computer science. This example displays an implementation of a simple package providing an abstraction of directed graphs. The specification includes type definitions that culminate in the Obj record type. Obj serves to define the structure of directed graphs. The user is responsible for allocation, initialization and manipulation of the nodes that form a graph.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag New York Inc.

About this chapter

Cite this chapter

Hibbard, P., Hisgen, A., Rosenberg, J., Shaw, M., Sherman, M. (1983). A Simple Graph Package Providing an Iterator. In: Studies in Ada® Style. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-5517-8_6

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-5517-8_6

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-90816-8

  • Online ISBN: 978-1-4612-5517-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics