|
|||||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||||
| Packages that use edu.uci.ics.jung.graph.impl | |
| edu.uci.ics.jung.algorithms.blockmodel | |
| edu.uci.ics.jung.graph.impl | |
| edu.uci.ics.jung.utils | |
| Classes in edu.uci.ics.jung.graph.impl used by edu.uci.ics.jung.algorithms.blockmodel | |
| AbstractSparseEdge
This class provides a skeletal implementation of the Edge
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. |
|
| BipartiteVertex
created Dec 28, 2003 |
|
| DirectedSparseEdge
An implementation of DirectedEdge that resides in a
directed graph. |
|
| SimpleSparseVertex
An implementation of Vertex that resides in a
sparse graph which may contain both directed and undirected edges.
|
|
| 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. |
|
| Classes in edu.uci.ics.jung.graph.impl used by edu.uci.ics.jung.graph.impl | |
| 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 |
|
| HypervertexBPG
A Hypervertex has zero or more hyperEdges attached to it, and is a member of a Hypergraph. |
|
| 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. |
|
| 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.
|
|
| Classes in edu.uci.ics.jung.graph.impl used by edu.uci.ics.jung.utils | |
| AbstractSparseGraph
This class provides a skeletal implementation of the Graph
interface to minimize the effort required to implement this interface. |
|
|
|||||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||||