|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use UserDataContainer | |
---|---|
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 | Specifies the interfaces for and capabilities of the JUNG vertex, edge, and graph classes. |
edu.uci.ics.jung.graph.decorators | Provides mechanisms for annotating nodes consistently with useful information. |
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. |
scratch.danyel.lazy | |
scratch.scott.event | |
scratch.scott.partition |
Uses of UserDataContainer in edu.uci.ics.jung.algorithms.blockmodel |
---|
Subinterfaces of UserDataContainer in edu.uci.ics.jung.algorithms.blockmodel | |
---|---|
static interface |
GraphCollapser.CollapsedEdge
The CollapsedEdge interface represents a set of edges in some other graph. |
static interface |
GraphCollapser.CollapsedVertex
This interface represents a vertex that holds a set of objects in some other graph. |
Classes in edu.uci.ics.jung.algorithms.blockmodel that implement UserDataContainer | |
---|---|
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. |
Uses of UserDataContainer in edu.uci.ics.jung.graph |
---|
Subinterfaces of UserDataContainer in edu.uci.ics.jung.graph | |
---|---|
interface |
ArchetypeEdge
A interface for edge implementations in generalized graphs. |
interface |
ArchetypeGraph
A generalized graph which consists of an ArchetypeVertex
set and an ArchetypeEdge set. |
interface |
ArchetypeVertex
A interface for vertex implementations in generalized graphs. |
interface |
DirectedEdge
A type of Edge which imposes an ordering on its incident
vertices. |
interface |
DirectedGraph
A tagging interface for implementations of Graph
whose edge set consists of implementations of DirectedEdge . |
interface |
Edge
A specific type of ArchetypeEdge that connects exactly
two instances of Vertex . |
interface |
Element
An interface for elements (vertices and edges) of generalized graphs. |
interface |
Graph
A specific type of ArchetypeGraph which consists of
a Vertex set and an Edge set. |
interface |
Hyperedge
An element of a Hypergraph that connects to zero or more Hypervertices. |
interface |
Hypergraph
A Hypergraph consists of hypervertices and hyperedges. |
interface |
Hypervertex
An element of a Hypergraph that connects to zero or more Hyperedges. |
interface |
KPartiteGraph
An interface for k-partite graphs. |
interface |
UndirectedEdge
A tagging interface for implementations of Edge that do not
impose an ordering on their incident vertices. |
interface |
UndirectedGraph
A tagging interface for implementations of Graph
whose edge set consists of implementations of UndirectedEdge . |
interface |
Vertex
A specific type of ArchetypeVertex that can be connected
by instances of Edge . |
Uses of UserDataContainer in edu.uci.ics.jung.graph.decorators |
---|
Methods in edu.uci.ics.jung.graph.decorators with parameters of type UserDataContainer | |
---|---|
Number |
NumericDecorator.getValue(UserDataContainer udc)
Returns the decorated value as Number |
int |
NumericDecorator.intValue(UserDataContainer udc)
Retrieves the decorated value for the given graph/vertex/edge as an integer |
void |
Decorator.removeValue(UserDataContainer udc)
Removes the values from the user data container |
void |
NumericDecorator.setValue(Number value,
UserDataContainer udc)
Sets the value for a given graph/vertex/edge |
Uses of UserDataContainer in edu.uci.ics.jung.graph.impl |
---|
Classes in edu.uci.ics.jung.graph.impl that implement UserDataContainer | |
---|---|
class |
AbstractArchetypeEdge
|
class |
AbstractArchetypeGraph
|
class |
AbstractArchetypeVertex
|
class |
AbstractElement
|
class |
AbstractHyperedge
This class provides a skeletal implementation of the Hyperedge
interface to minimize the effort required to implement this interface. |
class |
AbstractHyperUnitBPG
Deprecated. As of version 1.7, JUNG now includes native versions of hypergraph classes. |
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 |
AbstractSparseGraph
This class provides a skeletal implementation of the Graph
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 |
BipartiteGraph
A Bipartite graph is divided into A vertices and B vertices. |
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 |
DirectedSparseGraph
An implementation of Graph that consists of a
Vertex set and a DirectedEdge set. |
class |
DirectedSparseVertex
A vertex class that supports directed edges (but not undirected edges) and allows parallel edges. |
class |
HyperedgeBPG
Deprecated. As of version 1.7, replaced by native implementations of Hyperedge . |
class |
HypergraphBPG
Deprecated. As of version 1.7, replaced by SetHypergraph . |
class |
HypervertexBPG
A Hypervertex has zero or more hyperEdges attached to it, and is a member of a Hypergraph. |
class |
KPartiteSparseGraph
An implementation of KPartiteGraph based on SparseGraph. |
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 |
SetHypergraph
A basic implementation of Hypergraph . |
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 |
SparseGraph
An implementation of AbstractSparseGraph that, by default, imposes no
constraints on the edges and vertices that may be added to it. |
class |
SparseTree
An implementation of Graph that consists of a
Vertex set and a DirectedEdge set. |
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 |
UndirectedSparseGraph
An implementation of Graph that consists of a
Vertex set and an UndirectedEdge set. |
class |
UndirectedSparseVertex
A vertex class for instances of UndirectedGraph
that may contain parallel edges. |
Methods in edu.uci.ics.jung.graph.impl with parameters of type UserDataContainer | |
---|---|
void |
AbstractHyperUnitBPG.importUserData(UserDataContainer udc)
Deprecated. |
void |
HypergraphBPG.importUserData(UserDataContainer udc)
Deprecated. |
Uses of UserDataContainer in edu.uci.ics.jung.utils |
---|
Classes in edu.uci.ics.jung.utils that implement UserDataContainer | |
---|---|
class |
DefaultUserData
Represents custom user- and system-level information to extend the definition of a node. |
class |
UnifiedUserData
Represents custom user- and system-level information to extend the definition of a node. |
class |
UserData
Represents custom user- and system-level information to extend the definition of a node. |
class |
UserDataDelegate
|
Fields in edu.uci.ics.jung.utils declared as UserDataContainer | |
---|---|
protected UserDataContainer |
UserDataDelegate.udc_delegate
|
Methods in edu.uci.ics.jung.utils that return UserDataContainer | |
---|---|
UserDataContainer |
DefaultUserData.getInstance()
|
UserDataContainer |
UnifiedUserData.getInstance()
|
UserDataContainer |
UserDataFactory.getInstance()
Returns a single UserDataContainer instance. |
Methods in edu.uci.ics.jung.utils with parameters of type UserDataContainer | |
---|---|
void |
DefaultUserData.importUserData(UserDataContainer udc)
Uses the CopyAction to determine how each of the user datum elements in udc should be carried over to the this UserDataContiner |
void |
UnifiedUserData.importUserData(UserDataContainer udc)
Uses the CopyAction to determine how each of the user datum elements in udc should be carried over to the this UserDataContiner |
void |
UserDataContainer.importUserData(UserDataContainer udc)
Takes the user data stored in udc and copies it to this object's user data repository, respecting each datum's CopyAction. |
void |
UserDataDelegate.importUserData(UserDataContainer udc)
|
Object |
UserDataContainer.CopyAction.onCopy(Object value,
UserDataContainer source,
UserDataContainer target)
The callback triggered when a UserDatum is copied. |
Object |
UserDataContainer.CopyAction.Clone.onCopy(Object value,
UserDataContainer source,
UserDataContainer target)
|
Object |
UserDataContainer.CopyAction.Shared.onCopy(Object value,
UserDataContainer source,
UserDataContainer target)
|
Object |
UserDataContainer.CopyAction.Remove.onCopy(Object value,
UserDataContainer source,
UserDataContainer target)
|
Uses of UserDataContainer in scratch.danyel.lazy |
---|
Classes in scratch.danyel.lazy that implement UserDataContainer | |
---|---|
class |
LazySparseVertex
|
Uses of UserDataContainer in scratch.scott.event |
---|
Methods in scratch.scott.event that return UserDataContainer | |
---|---|
UserDataContainer |
GraphEvent.getGraphElement()
|
Constructors in scratch.scott.event with parameters of type UserDataContainer | |
---|---|
GraphEvent(GraphEventType eventType,
UserDataContainer graphElement)
|
Uses of UserDataContainer in scratch.scott.partition |
---|
Methods in scratch.scott.partition with parameters of type UserDataContainer | |
---|---|
protected void |
AbstractPartitionClass.add(UserDataContainer udc)
|
void |
AbstractPartition.classify(UserDataContainer udc,
AbstractPartitionClass aPartitionClass)
|
AbstractPartitionClass |
AbstractPartition.getElement(UserDataContainer udc)
|
protected void |
AbstractPartitionClass.remove(UserDataContainer udc)
|
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |