|
Class Summary |
| AbstractArchetypeGraph |
|
| AbstractHyperUnitBPG |
A support class for both HyperedgeBPG and HyperVertexBPG,
this represents a single object backed by a BipartiteVertex
that is a member of a HypergraphBPG. |
| 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 |
| 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 |
A HyperEdge has zero or more HyperVertices attached to it;
this implements that as part of an underlying HyperGraph. |
| HypergraphBPG |
Implements a hypergraph built over an underlying
Bipartite graph, using the equivalence explained in
the FAQ. |
| 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.
|
| 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.
|