| Interface | Description |
|---|---|
| Graph<T,U> |
This interface defines the generic graph data structure.
|
| Graph.Edge<T,U> |
Interface for edges in the graph.
|
| Graph.EdgeFilter<T,U> |
Edge filter that determines if an edge should be included in a traversal.
|
| Graph.GraphConsumer<T,U> |
Consumer interface for graph traversal.
|
| Graph.GraphVisitor<T,U> |
Visitor interface for graph traversal.
|
| Graph.Path<T> |
Defines a path between two nodes in the graph.
|
| Class | Description |
|---|---|
| Graph.BasePath<T> |
A simple implementation for the Path interface.
|
| Graph.Edge.BaseEdge<T,U> |
Basic implementation of the Edge interface.
|
| Graph.EdgeFilter.IdentityEdgeFilter<T,U> |
An edge filter that always returns true.
|
| HashGraph<T,U> |
This class is used to construct and manage graph structures.
|
| HashGraph.HashEdge<T,U> |
This class is the edge between nodes in the graph.
|
| HashGraph.HashNode<T,U> |
This class is a single node in the HashGraph.
|
| MapBuilder<T,U> |
Builds Maps.
|
| Exception | Description |
|---|---|
| CyclicException |
This class is thrown from a Graph that contains circular references that cannot be dealt with.
|