See: Description
Class | Description |
---|---|
AbstractArchetypeEdge | |
AbstractArchetypeGraph | |
AbstractArchetypeVertex | |
AbstractElement | |
AbstractHyperedge |
This class provides a skeletal implementation of the
Hyperedge
interface to minimize the effort required to implement this interface. |
AbstractHyperUnitBPG | Deprecated
As of version 1.7, JUNG now includes native versions of hypergraph classes.
|
AbstractHypervertex |
This class provides a skeletal implementation of the
Hypervertex
interface to minimize the effort required to implement this interface. |
AbstractSparseEdge |
This class provides a skeletal implementation of the
Edge
interface to minimize the effort required to implement this interface. |
AbstractSparseGraph |
This class provides a skeletal implementation of the
Graph
interface to minimize the effort required to implement this interface. |
AbstractSparseVertex |
This class provides a skeletal implementation of the
Vertex
interface to minimize the effort required to implement this interface. |
BipartiteEdge |
A simple extension of the UndirectedSparseEdge, except
with careful bounds checking.
|
BipartiteGraph |
A Bipartite graph is divided into A vertices and B vertices.
|
BipartiteGraph.Choice |
This small enumerated type merely forces a user to pick class "A"
or "B" when adding a Vertex to a BipartiteGraph.
|
BipartiteVertex |
created Dec 28, 2003
|
CollectionHyperedge |
An implementation of
Hyperedge that stores its
collection of incident vertices internally as a Collection . |
CollectionHypervertex | |
DirectedSparseEdge |
An implementation of
DirectedEdge that resides in a
directed graph. |
DirectedSparseGraph |
An implementation of
Graph that consists of a
Vertex set and a DirectedEdge set. |
DirectedSparseVertex |
A vertex class that supports directed edges (but not
undirected edges) and allows parallel edges.
|
HyperedgeBPG | Deprecated
As of version 1.7, replaced by native implementations of
Hyperedge . |
HypergraphBPG | Deprecated
As of version 1.7, replaced by
SetHypergraph . |
HypervertexBPG |
A Hypervertex has zero or more hyperEdges attached to it, and
is a member of a Hypergraph.
|
KPartiteSparseGraph |
An implementation of KPartiteGraph based on SparseGraph.
|
LeanSparseVertex |
This fully functional class is provided as a different sort of way to think about the creation
and use of Vertices, and a reminder that the user is always welcome to create
their own vertices.
|
ListHyperedge |
An implementation of
Hyperedge that stores its
list of incident vertices internally as a List . |
ListHypervertex |
An implementation of
Hypervertex that stores its
incident edges as a List internally. |
SetHyperedge |
An implementation of
Hyperedge that stores its
collection of incident vertices internally as a Set . |
SetHypergraph |
A basic implementation of
Hypergraph . |
SetHypervertex |
An implementation of
Hypervertex that maintains
independent Set s of incident edges and neighbors. |
SimpleDirectedSparseVertex |
An implementation of
Vertex that resides in a
directed graph; none of its adjoining edges may be parallel. |
SimpleSparseVertex |
An implementation of
Vertex that resides in a
sparse graph which may contain both directed and undirected edges. |
SimpleUndirectedSparseVertex |
An implementation of
Vertex that resides in a
undirected graph; none of its adjoining edges may be parallel. |
SparseGraph |
An implementation of
AbstractSparseGraph that, by default, imposes no
constraints on the edges and vertices that may be added to it. |
SparseTree |
An implementation of
Graph that consists of a
Vertex set and a DirectedEdge set. |
SparseVertex |
An implementation of
Vertex that resides in a
sparse graph which may contain directed and/or undirected edges,
as well as parallel edges. |
UndirectedSparseEdge |
An implementation of
UndirectedEdge that resides
in an undirected graph. |
UndirectedSparseGraph |
An implementation of
Graph that consists of a
Vertex set and an UndirectedEdge set. |
UndirectedSparseVertex |
A vertex class for instances of
UndirectedGraph
that may contain parallel edges. |
The Abstract classes provide skeletal implementations of the Graph, Edge, and Vertex interfaces, so as to minimize the amount of work necessary to produce functioning classes. The Directed and Undirected implementations extend the Abstract implementations for directed and undirected graphs, respectively.
In addition, BipartiteGraph implements a package for graphs constrained such that vertices from one class can only connect to vertices from the other, and vice versa.
Last, the HypergraphBPG implements a version of Hypergraph built over BipartiteGraph.