The Unbounded Directed Graph
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.
KeywordsDirected Edge Edge Node Initial Vertex Loop Index Exception Handler
Unable to display preview. Download preview PDF.
- G. Booch, Software Components with Ada Structures, Tools, and Subsystems, Benjamin/Cummings, Menlo Park, CA 1987.Google Scholar