class |
DirectedOrderedSparseMultigraph<V,E> |
An implementation of DirectedGraph , suitable for sparse graphs,
that orders its vertex and edge collections
according to insertion time.
|
class |
DirectedSparseGraph<V,E> |
An implementation of DirectedGraph suitable for sparse graphs.
|
class |
DirectedSparseMultigraph<V,E> |
An implementation of DirectedGraph , suitable for sparse graphs,
that permits parallel edges.
|
class |
OrderedKAryTree<V,E> |
An implementation of Tree in which each vertex has
≤ k children.
|
class |
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.
|
class |
UndirectedSparseGraph<V,E> |
An implementation of UndirectedGraph that is suitable
for sparse graphs.
|
class |
UndirectedSparseMultigraph<V,E> |
An implementation of UndirectedGraph that is suitable for
sparse graphs and permits parallel edges.
|