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

Packages that use UserData
edu.uci.ics.jung.algorithms.blockmodel   
edu.uci.ics.jung.graph.impl   
 

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

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

Subclasses of UserData in edu.uci.ics.jung.graph.impl
 class AbstractArchetypeGraph
           
 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 HypergraphBPG
          Implements a hypergraph built over an underlying Bipartite graph, using the equivalence explained in the FAQ.
 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.