Previous Next Index Interface structure. Collection The interface describing all Graph objects. Graphs are collections of vertices connected by a set of edges. Edges may or may not be directed. Portions of the graph may be marked visited to support iterative algorithms.
Iteration is provided over vertices, edges, and vertices adjacent to a particular vertex.
Add an edge between two vertices within the graph. Determine out degree of vertex. Determine the number of edges in graph. Construct an iterator over all edges. Determine if graph is directed.