See: Description
| Class | Description | 
|---|---|
| AbstractListMapGraph<N,ET extends Edge<N>> | This Graph uses redundant storage to improve query speed for certain methods. | 
| AbstractSetMapGraph<N,ET extends Edge<N>> | This Graph uses redundant storage to improve query speed for certain methods. | 
| DefaultDirectionalGraphEdge<N> | Represents a default implementation of a Directional GraphEdge. | 
| DefaultDirectionalHyperEdge<N> | A DefaultDirectionalHyperEdge is a default implementation of a
 DirectionalHyperEdge. | 
| DefaultGraphEdge<N> | Represents a default implementation of GraphEdge. | 
| DefaultHyperEdge<N> | A DefaultHyperEdge is a default implementation of a non-directional
 HyperEdge. | 
| DirectionalSetMapGraph<N,ET extends DirectionalEdge<N>> | A DirectionalSetMapGraph is a DirectionalGraph. | 
| GraphChangeSupport<N,ET extends Edge<N>> | A GraphChangeSupport object is an object which is designed to assist in
 monitoring changes to a Graph. | 
| SimpleListGraph<N,ET extends Edge<N>> | This class is a simple Graph which stores a List of the nodes and edges in
 the Graph. | 
| SimpleListMapGraph<N,ET extends Edge<N>> | This Graph uses redundant storage to improve query speed for certain methods. |