

We've mentioned several times that a Graph Algorithms package accompanies the Graph package we've just described. Eighteen algorithms are included in this package, representing some of the more commonly used ones.
In the following description of the Graph Algorithms, we'll use the generic Graph, Vertex, and Edge terminology for convenience since all of the Algorithms are applicable to both the generic and userderived classes; and we'll use the suffix ``_u'' to name an algorithm when it is to be used in undirected Graphs.