Uses of Interface
edu.uci.ics.jung.utils.UserDataContainer

Packages that use UserDataContainer
edu.uci.ics.jung.algorithms.blockmodel   
edu.uci.ics.jung.algorithms.cluster   
edu.uci.ics.jung.algorithms.importance   
edu.uci.ics.jung.graph   
edu.uci.ics.jung.graph.decorators   
edu.uci.ics.jung.graph.event   
edu.uci.ics.jung.graph.impl   
edu.uci.ics.jung.utils   
 

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.algorithms.cluster
 

Methods in edu.uci.ics.jung.algorithms.cluster with parameters of type UserDataContainer
 java.util.Set ClusterSet.getClusters(UserDataContainer element)
          Given a vertex (or edge), retrieves the clusters which that vertex (or edge) belongs to if any
 

Uses of UserDataContainer in edu.uci.ics.jung.algorithms.importance
 

Methods in edu.uci.ics.jung.algorithms.importance with parameters of type UserDataContainer
 double MarkovCentrality.getRankScore(UserDataContainer vert)
           
 double HITSWithPriors.getRankScore(UserDataContainer v)
          Given a node, returns the corresponding rank score.
 double HITS.getRankScore(UserDataContainer v)
          Given a node, returns the corresponding rank score.
 double AbstractRanker.getRankScore(UserDataContainer v)
          Given an edge or node, returns the corresponding rank score.
 

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 Graph
          A specific type of ArchetypeGraph which consists of a Vertex set and an Edge set.
 interface Hyperedge
          A Hyperedge is a part of a hypergraph that connects to zero or more Hypervertices.
 interface Hypergraph
          A Hypergraph consists of hypervertices and hyperedges.
 interface Hypervertex
          created Dec 28, 2003
 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
 int NumericDecorator.intValue(UserDataContainer udc)
          Retrieves the decorated value for the given graph/vertex/edge as an integer
 java.lang.Number NumericDecorator.getValue(UserDataContainer udc)
          Returns the decorated value as Number
 void NumericDecorator.setValue(java.lang.Number value, UserDataContainer udc)
          Sets the value for a given graph/vertex/edge
 void Decorator.removeValue(UserDataContainer udc)
          Removes the values from the user data container
 

Uses of UserDataContainer in edu.uci.ics.jung.graph.event
 

Methods in edu.uci.ics.jung.graph.event that return UserDataContainer
 UserDataContainer GraphEvent.getGraphElement()
           
 

Constructors in edu.uci.ics.jung.graph.event with parameters of type UserDataContainer
GraphEvent(ArchetypeGraph g, UserDataContainer graphElement)
           
 

Uses of UserDataContainer in edu.uci.ics.jung.graph.impl
 

Classes in edu.uci.ics.jung.graph.impl that implement UserDataContainer
 class AbstractArchetypeGraph
           
 class 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.
 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 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
          A HyperEdge has zero or more HyperVertices attached to it; this implements that as part of an underlying HyperGraph.
 class HypergraphBPG
          Implements a hypergraph built over an underlying Bipartite graph, using the equivalence explained in the FAQ.
 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 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 HypergraphBPG.importUserData(UserDataContainer udc)
           
 void AbstractHyperUnitBPG.importUserData(UserDataContainer udc)
           
 

Uses of UserDataContainer in edu.uci.ics.jung.utils
 

Classes in edu.uci.ics.jung.utils that implement UserDataContainer
 class UserData
          Represents custom user- and system-level information to extend the definition of a node.
 

Methods in edu.uci.ics.jung.utils with parameters of type UserDataContainer
 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.
 java.lang.Object UserDataContainer.CopyAction.onCopy(java.lang.Object value, UserDataContainer source, UserDataContainer target)
          The callback triggered when a UserDatum is copied.
 java.lang.Object UserDataContainer.CopyAction.Clone.onCopy(java.lang.Object value, UserDataContainer source, UserDataContainer target)
           
 java.lang.Object UserDataContainer.CopyAction.Shared.onCopy(java.lang.Object value, UserDataContainer source, UserDataContainer target)
           
 java.lang.Object UserDataContainer.CopyAction.Remove.onCopy(java.lang.Object value, UserDataContainer source, UserDataContainer target)
           
 void UserData.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