Package | Description |
---|---|
edu.uci.ics.jung.algorithms.blockmodel |
Implementations of a notion of graph equivalence for blockmodeling, and a mechanism for collapsing blocks.
|
edu.uci.ics.jung.graph.impl |
Implementations of the JUNG vertex, edge, and graph interfaces.
|
edu.uci.ics.jung.utils |
Provides a series of useful utility methods, and a number of custom helper classes designed specifically for this application.
|
edu.uci.ics.jung.visualization.contrib |
These are additional layouts contributed by various users.
|
scratch.danyel.lazy |
Class and Description |
---|
AbstractArchetypeEdge |
AbstractArchetypeVertex |
AbstractElement |
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. |
Class and Description |
---|
AbstractArchetypeEdge |
AbstractArchetypeGraph |
AbstractArchetypeGraph.Requirements |
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 |
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.
|
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. |
Class and Description |
---|
AbstractSparseGraph
This class provides a skeletal implementation of the
Graph
interface to minimize the effort required to implement this interface. |
Class and Description |
---|
SparseTree
An implementation of
Graph that consists of a
Vertex set and a DirectedEdge set. |
Class and Description |
---|
AbstractArchetypeVertex |
AbstractElement |
AbstractSparseVertex
This class provides a skeletal implementation of the
Vertex
interface to minimize the effort required to implement this interface. |
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. |