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.
|
scratch.danyel.lazy |
Modifier and Type | Class and Description |
---|---|
class |
BipartiteGraphCollapser.CollapsedBipartiteEdge |
class |
BipartiteGraphCollapser.CollapsedBipartiteVertex |
static class |
GraphCollapser.CollapsedSparseVertex
A CollapsedSparseVertex extends CollapsedVertex.
|
static class |
GraphCollapser.DirectedCollapsedEdge
This class represents a Collapsed Directed edge,
and extends DirectedSparseEdge.
|
static class |
GraphCollapser.UndirectedCollapsedEdge
This class represents a Collapsed Undirected edge,
and extends UndirectedSparseEdge.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractArchetypeEdge |
class |
AbstractArchetypeVertex |
class |
AbstractHyperedge
This class provides a skeletal implementation of the
Hyperedge
interface to minimize the effort required to implement this interface. |
class |
AbstractHypervertex
This class provides a skeletal implementation of the
Hypervertex
interface to minimize the effort required to implement this interface. |
class |
AbstractSparseEdge
This class provides a skeletal implementation of the
Edge
interface to minimize the effort required to implement this interface. |
class |
AbstractSparseVertex
This class provides a skeletal implementation of the
Vertex
interface to minimize the effort required to implement this interface. |
class |
BipartiteEdge
A simple extension of the UndirectedSparseEdge, except
with careful bounds checking.
|
class |
BipartiteVertex
created Dec 28, 2003
|
class |
CollectionHyperedge
An implementation of
Hyperedge that stores its
collection of incident vertices internally as a Collection . |
class |
CollectionHypervertex |
class |
DirectedSparseEdge
An implementation of
DirectedEdge that resides in a
directed graph. |
class |
DirectedSparseVertex
A vertex class that supports directed edges (but not
undirected edges) and allows parallel edges.
|
class |
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.
|
class |
ListHyperedge
An implementation of
Hyperedge that stores its
list of incident vertices internally as a List . |
class |
ListHypervertex
An implementation of
Hypervertex that stores its
incident edges as a List internally. |
class |
SetHyperedge
An implementation of
Hyperedge that stores its
collection of incident vertices internally as a Set . |
class |
SetHypervertex
An implementation of
Hypervertex that maintains
independent Set s of incident edges and neighbors. |
class |
SimpleDirectedSparseVertex
An implementation of
Vertex that resides in a
directed graph; none of its adjoining edges may be parallel. |
class |
SimpleSparseVertex
An implementation of
Vertex that resides in a
sparse graph which may contain both directed and undirected edges. |
class |
SimpleUndirectedSparseVertex
An implementation of
Vertex that resides in a
undirected graph; none of its adjoining edges may be parallel. |
class |
SparseVertex
An implementation of
Vertex that resides in a
sparse graph which may contain directed and/or undirected edges,
as well as parallel edges. |
class |
UndirectedSparseEdge
An implementation of
UndirectedEdge that resides
in an undirected graph. |
class |
UndirectedSparseVertex
A vertex class for instances of
UndirectedGraph
that may contain parallel edges. |
Modifier and Type | Class and Description |
---|---|
class |
LazySparseVertex |