Uses of Class
edu.uci.ics.jung.utils.UserDataDelegate

Packages that use UserDataDelegate
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   
 

Uses of UserDataDelegate in edu.uci.ics.jung.algorithms.blockmodel
 

Subclasses of UserDataDelegate in edu.uci.ics.jung.algorithms.blockmodel
 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 UserDataDelegate in edu.uci.ics.jung.graph.impl
 

Subclasses of UserDataDelegate in edu.uci.ics.jung.graph.impl
 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 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 HypergraphBPG
          Deprecated. As of version 1.7, replaced by SetHypergraph.
 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 Sets 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.
 

Uses of UserDataDelegate in scratch.danyel.lazy
 

Subclasses of UserDataDelegate in scratch.danyel.lazy
 class LazySparseVertex