| Class | Description |
|---|---|
| AbstractGraph<V,E> |
Abstract implementation of the
Graph interface. |
| AbstractTypedGraph<V,E> |
An abstract class for graphs whose edges all have the same
EdgeType. |
| DelegateForest<V,E> |
An implementation of
Forest that delegates to a specified DirectedGraph
instance. |
| DelegateTree<V,E> |
An implementation of
Tree that delegates to
a specified instance of DirectedGraph. |
| DirectedOrderedSparseMultigraph<V,E> |
An implementation of
DirectedGraph, suitable for sparse graphs,
that orders its vertex and edge collections
according to insertion time. |
| DirectedSparseGraph<V,E> |
An implementation of
DirectedGraph suitable for sparse graphs. |
| DirectedSparseMultigraph<V,E> |
An implementation of
DirectedGraph, suitable for sparse graphs,
that permits parallel edges. |
| OrderedKAryTree<V,E> |
An implementation of
Tree in which each vertex has
≤ k children. |
| OrderedSparseMultigraph<V,E> |
An implementation of
Graph that orders its vertex and edge collections
according to insertion time, is suitable for sparse graphs, and
permits directed, undirected, and parallel edges. |
| SetHypergraph<V,H> |
An implementation of
Hypergraph that is suitable for sparse graphs and
permits parallel edges. |
| SortedSparseMultigraph<V,E> |
An implementation of
Graph that is suitable for sparse graphs,
orders its vertex and edge collections according to either specified Comparator
instances or the natural ordering of their elements, and permits directed, undirected,
and parallel edges. |
| SparseGraph<V,E> |
An implementation of
Graph that is suitable for sparse graphs and
permits both directed and undirected edges. |
| SparseMultigraph<V,E> |
An implementation of
Graph that is suitable for sparse graphs
and permits directed, undirected, and parallel edges. |
| UndirectedOrderedSparseMultigraph<V,E> |
An implementation of
UndirectedGraph that is suitable for sparse graphs,
orders its vertex and edge collections according to insertion time, and permits
parallel edges. |
| UndirectedSparseGraph<V,E> |
An implementation of
UndirectedGraph that is suitable
for sparse graphs. |
| UndirectedSparseMultigraph<V,E> |
An implementation of
UndirectedGraph that is suitable for
sparse graphs and permits parallel edges. |
Copyright © 2016. All rights reserved.