See: Description
Interface | Description |
---|---|
ArchetypeEdge |
A interface for edge implementations in generalized graphs.
|
ArchetypeGraph |
A generalized graph which consists of an
ArchetypeVertex
set and an ArchetypeEdge set. |
ArchetypeVertex |
A interface for vertex implementations in generalized graphs.
|
DirectedEdge |
A type of
Edge which imposes an ordering on its incident
vertices. |
DirectedGraph |
A tagging interface for implementations of
Graph
whose edge set consists of implementations of DirectedEdge . |
Edge |
A specific type of
ArchetypeEdge that connects exactly
two instances of Vertex . |
Element |
An interface for elements (vertices and edges) of generalized graphs.
|
Graph |
A specific type of
ArchetypeGraph which consists of
a Vertex set and an Edge set. |
Hyperedge |
An element of a Hypergraph that
connects to zero or more Hypervertices.
|
Hypergraph |
A Hypergraph consists of hypervertices and hyperedges.
|
Hypervertex |
An element of a Hypergraph that
connects to zero or more Hyperedges.
|
KPartiteGraph |
An interface for k-partite graphs.
|
UndirectedEdge |
A tagging interface for implementations of
Edge that do not
impose an ordering on their incident vertices. |
UndirectedGraph |
A tagging interface for implementations of
Graph
whose edge set consists of implementations of UndirectedEdge . |
Vertex |
A specific type of
ArchetypeVertex that can be connected
by instances of Edge . |
Specifies the interfaces for and capabilities of the JUNG vertex, edge, and graph classes.
In general, a graph consists of a vertex set and an edge set. The Archetype interfaces are the most general, and should encompass all types of graphs including hypergraphs and graphs with parallel edges. The Graph, Vertex, and Edge interfaces specify the behavior for (binary) graphs in which each edge connects exactly two vertices, and the Directed and Undirected interfaces describe the specific operations available to graphs which contain directed and undirected edges, respectively.
The impl
package contains implementations of these
interfaces, including SparseGraph
, BipartiteGraph
,
and KPartiteSparseGraph
.
In addition, the Hypergraph, -Vertex, and -Edge interfaces specify the behavior for the general Hypergraph, in which an edge can contain any number of vertices. The impl package contains HypergraphBPG, an implementation of Hypergraph that uses BipartiteGraph as an underlying data type.