Next: Introduction Up: Link 1.3 Previous: Contents

## List of Figures

- Our first graph: the empty graph
- Creating an undirected hypergraph
- Computing the sum of two graphs
- Adding Vertices One by One
- Adding Ranges of Vertices
- A Short Program to Add Vertices
- Definition of sets and multisets
- Definition of sequences
- Conversions between collections and Scheme lists
- Membership testing in collections
- Example of overloaded method: null?
- Defining generic functions which take collections as arguments
- Comparing collections
- The set primitive operations
- k-sets and power sets of a set
- Creating and manipulating vectors
- Typed vs. untyped vectors
- Conversion of typed vector to Scheme list
- Copying of typed vectors
- Comparison of typed vectors
- Vertex neighbors
- Vertex neighbors, directed graphs
- Finding attributes
- Manipulating attributes
- Defining graph functions:
- Makefile macros intended to be modified by the LINK library programmer.
- An example wrapper routine
- An example graph generating algorithm
- An example wrapper for a graph generating algorithm
- algorithmSTkInit.cpp
- Depth-First Search
- The ElementOps Class
- Use of Iterator
- List objects
- List constructors
- List and SortedList
- Comparisons of Containers
- DList
- Special DList operations
- Comparisons of List and DList
- Iteration and Array objects
- Arrays and SortedArrays
- BinaryHeap
- Another BinaryHeap example
- BinarySearchTree
- RedBlackTree
- The Collection Hierarchy
- Reference Counting in Collections
- Reference Counting and Modifications in Collections
- Passing and Returning Collection Objects
- Comparisons Between Collections and Containers
- Comparisons between Collections
- The Set Primitive Operations
- Set Primitives with Set and Sequence Operands
- MSetBase and MSet
- Sequence
- Another Sequence Example
- Graph Attributes
- ``Mixed'' Binary Graph
- Directed Binary Graph
- Directed Binary Multigraph
- Undirected Binary Multigraph
- Saving a LINK Graph
- Loading a LINK Graph from Disk
- Copying a Graph without its Attributes
- The GraphHierarchy
- Depth-First Search
- The LINK Directory Structure