This section describes how graph algorithms interact with the NetWorKs program. Because graph algorithms manipulate the vertices and edges of graphs, the section begins by describing the data structures used for storage. Following this is a discussion of the graph algorithm side of the interface, which is defined by a GraphAlgorithm base class. Next, adding graph algorithms to the NetWorKs program using the Algorithms class is described. This is followed by a discussion of the NetWorKs side of the interface, which consists of selected public methods and constants from various classes relevant to graph algorithms. See the GraphAlgorithm Class Extensions section for source code and detailed discussions of the currently implemented graph algorithms.