3 Abstract Data Types for Graphs
Graph algorithms in this document are described using an abstract data type paradigm. That is, data sets and operators are specified, but the actual data structures used to implement them remain undefined. Any data structure that efficiently satisfies the constraints imposed in this section is suited for the job.
All signals emitted by operators defined in this section are used to navigate through data, not to indicate errors. Error processing is intentionally omitted from the algorithms in this document. The intent is to avoid clutter that obscures the nature of the algorithms.