Package | Description |
---|---|
edu.uci.ics.jung.graph |
Interfaces for the JUNG graph types, and some representative implementations.
|
Modifier and Type | Class and Description |
---|---|
class |
DirectedOrderedSparseMultigraph<V,E>
An implementation of
DirectedGraph , suitable for sparse graphs,
that orders its vertex and edge collections
according to insertion time. |
class |
DirectedSparseMultigraph<V,E>
An implementation of
DirectedGraph , suitable for sparse graphs,
that permits parallel edges. |
class |
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. |
class |
SetHypergraph<V,H>
An implementation of
Hypergraph that is suitable for sparse graphs and
permits parallel edges. |
class |
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. |
class |
SparseMultigraph<V,E>
An implementation of
Graph that is suitable for sparse graphs
and permits directed, undirected, and parallel edges. |
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 |
UndirectedSparseMultigraph<V,E>
An implementation of
UndirectedGraph that is suitable for
sparse graphs and permits parallel edges. |
Copyright © 2021, 2022 Herve Girod. All Rights Reserved. Documentation and source under the BSD 3-Clause licence