Uses of Package
edu.uci.ics.jung.graph

Packages that use edu.uci.ics.jung.graph
edu.uci.ics.jung.algorithms Provides a set of specialized algorithms for computing various measures on graphs as well as transforming graphs in different ways. 
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.algorithms.cluster Provides a series of methods for locating clusters in graphs according to some model-based, heuristic or graph-theoretic criteria. 
edu.uci.ics.jung.algorithms.connectivity Provides a series of methods for computing various aspects of a graph's overall connectivity structure. 
edu.uci.ics.jung.algorithms.flows Provides a series of methods for solving the s-t max flow and other network flow problems. 
edu.uci.ics.jung.algorithms.importance Provides a set of algorithms for computing the importance of each node (or edge) in a graph relative to all others (or, for the algorithms that inherit from RelativeAuthorityRanker, relative to a specified subset of elements). 
edu.uci.ics.jung.algorithms.metrics   
edu.uci.ics.jung.algorithms.shortestpath Provides a set of algorithms for computing the shortest path between two nodes or between each pair of nodes in a graph. 
edu.uci.ics.jung.algorithms.transformation   
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.event   
edu.uci.ics.jung.graph.filters Provides for a filtering mechanism that produces subgraphs of an original graph. 
edu.uci.ics.jung.graph.filters.impl Provides sample implementations and generally useful filters. 
edu.uci.ics.jung.graph.impl Implementations of the JUNG vertex, edge, and graph interfaces. 
edu.uci.ics.jung.graph.predicates A Predicate tests whether an Object satisfies a specific implementation-defined property. 
edu.uci.ics.jung.io Provides a set of graph file format interpreters for loading graphs from disk. 
edu.uci.ics.jung.random.generators Provides a series of methods for generating new graphs with various properties. 
edu.uci.ics.jung.random.permuters Provides a series of methods for permuting graphs in different ways. 
edu.uci.ics.jung.statistics Provides a set of statistical tools for analyzing graphs. 
edu.uci.ics.jung.utils Provides a series of useful utility methods, and a number of custom helper classes designed specifically for this application. 
edu.uci.ics.jung.visualization Provides a visualization mechanism for drawing and rendering Graphs. 
edu.uci.ics.jung.visualization.contrib These are additional layouts contributed by various users. 
edu.uci.ics.jung.visualization.control   
edu.uci.ics.jung.visualization.graphdraw Provides support classes for the GraphDraw mechanism: generalized functions so users can tweak variables freely when creating with EdgeDraw. 
edu.uci.ics.jung.visualization.subLayout   
edu.uci.ics.jung.visualization.transform.shape   
samples.graph Provides sample graph code that may be of interest. 
samples.graph.southern   
samples.preview_new_graphdraw This module provides a new way of thinking about graph drawing. 
samples.preview_new_graphdraw.event   
samples.preview_new_graphdraw.impl   
samples.preview_new_graphdraw.impl.crooked   
samples.preview_new_graphdraw.iter   
samples.preview_new_graphdraw.iterablelayouts   
samples.preview_new_graphdraw.staticlayouts   
samples.preview_new_graphdraw.test   
scratch.danyel   
scratch.danyel.lazy   
scratch.danyel.sample   
scratch.joshua.ranking   
scratch.scott   
scratch.scott.partition   
scratch.scott.registry   
test.edu.uci.ics.jung.algorithms.cluster   
test.edu.uci.ics.jung.algorithms.importance   
test.edu.uci.ics.jung.algorithms.shortestpath   
test.edu.uci.ics.jung.graph.impl   
test.edu.uci.ics.jung.graph.predicates   
test.edu.uci.ics.jung.io   
test.edu.uci.ics.jung.visualization   
 

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms
Edge
          A specific type of ArchetypeEdge that connects exactly two instances of Vertex.
Graph
          A specific type of ArchetypeGraph which consists of a Vertex set and an Edge set.
UndirectedGraph
          A tagging interface for implementations of Graph whose edge set consists of implementations of UndirectedEdge.
 

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.blockmodel
ArchetypeEdge
          A interface for edge implementations in generalized graphs.
ArchetypeVertex
          A interface for vertex implementations in generalized graphs.
DirectedEdge
          A type of Edge which imposes an ordering on its incident vertices.
Edge
          A specific type of ArchetypeEdge that connects exactly two instances of Vertex.
Element
          An interface for elements (vertices and edges) of generalized graphs.
Graph
          A specific type of ArchetypeGraph which consists of a Vertex set and an Edge set.
UndirectedEdge
          A tagging interface for implementations of Edge that do not impose an ordering on their incident vertices.
Vertex
          A specific type of ArchetypeVertex that can be connected by instances of Edge.
 

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.cluster
ArchetypeGraph
          A generalized graph which consists of an ArchetypeVertex set and an ArchetypeEdge set.
ArchetypeVertex
          A interface for vertex implementations in generalized graphs.
DirectedGraph
          A tagging interface for implementations of Graph whose edge set consists of implementations of DirectedEdge.
Element
          An interface for elements (vertices and edges) of generalized graphs.
Graph
          A specific type of ArchetypeGraph which consists of a Vertex set and an Edge set.
Vertex
          A specific type of ArchetypeVertex that can be connected by instances of Edge.
 

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.connectivity
DirectedGraph
          A tagging interface for implementations of Graph whose edge set consists of implementations of DirectedEdge.
Graph
          A specific type of ArchetypeGraph which consists of a Vertex set and an Edge set.
Vertex
          A specific type of ArchetypeVertex that can be connected by instances of Edge.
 

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.flows
DirectedGraph
          A tagging interface for implementations of Graph whose edge set consists of implementations of DirectedEdge.
Vertex
          A specific type of ArchetypeVertex that can be connected by instances of Edge.
 

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.importance
DirectedGraph
          A tagging interface for implementations of Graph whose edge set consists of implementations of DirectedEdge.
Edge
          A specific type of ArchetypeEdge that connects exactly two instances of Vertex.
Element
          An interface for elements (vertices and edges) of generalized graphs.
Graph
          A specific type of ArchetypeGraph which consists of a Vertex set and an Edge set.
UndirectedGraph
          A tagging interface for implementations of Graph whose edge set consists of implementations of UndirectedEdge.
Vertex
          A specific type of ArchetypeVertex that can be connected by instances of Edge.
 

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.metrics
DirectedGraph
          A tagging interface for implementations of Graph whose edge set consists of implementations of DirectedEdge.
Vertex
          A specific type of ArchetypeVertex that can be connected by instances of Edge.
 

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.shortestpath
ArchetypeEdge
          A interface for edge implementations in generalized graphs.
ArchetypeGraph
          A generalized graph which consists of an ArchetypeVertex set and an ArchetypeEdge set.
ArchetypeVertex
          A interface for vertex implementations in generalized graphs.
Edge
          A specific type of ArchetypeEdge that connects exactly two instances of Vertex.
Graph
          A specific type of ArchetypeGraph which consists of a Vertex set and an Edge set.
Vertex
          A specific type of ArchetypeVertex that can be connected by instances of Edge.
 

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.transformation
DirectedGraph
          A tagging interface for implementations of Graph whose edge set consists of implementations of DirectedEdge.
Element
          An interface for elements (vertices and edges) of generalized graphs.
Graph
          A specific type of ArchetypeGraph which consists of a Vertex set and an Edge set.
Hypergraph
          A Hypergraph consists of hypervertices and hyperedges.
KPartiteGraph
          An interface for k-partite graphs.
UndirectedGraph
          A tagging interface for implementations of Graph whose edge set consists of implementations of UndirectedEdge.
Vertex
          A specific type of ArchetypeVertex that can be connected by instances of Edge.
 

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.graph
ArchetypeEdge
          A interface for edge implementations in generalized graphs.
ArchetypeGraph
          A generalized graph which consists of an ArchetypeVertex set and an ArchetypeEdge set.
ArchetypeVertex
          A interface for vertex implementations in generalized graphs.
Edge
          A specific type of ArchetypeEdge that connects exactly two instances of Vertex.
Element
          An interface for elements (vertices and edges) of generalized graphs.
Graph
          A specific type of ArchetypeGraph which consists of a Vertex set and an Edge set.
Hyperedge
          An element of a Hypergraph that connects to zero or more Hypervertices.
Hypervertex
          An element of a Hypergraph that connects to zero or more Hyperedges.
Vertex
          A specific type of ArchetypeVertex that can be connected by instances of Edge.
 

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.graph.decorators
ArchetypeEdge
          A interface for edge implementations in generalized graphs.
ArchetypeGraph
          A generalized graph which consists of an ArchetypeVertex set and an ArchetypeEdge set.
ArchetypeVertex
          A interface for vertex implementations in generalized graphs.
Edge
          A specific type of ArchetypeEdge that connects exactly two instances of Vertex.
Graph
          A specific type of ArchetypeGraph which consists of a Vertex set and an Edge set.
Vertex
          A specific type of ArchetypeVertex that can be connected by instances of Edge.
 

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.graph.event
ArchetypeEdge
          A interface for edge implementations in generalized graphs.
ArchetypeGraph
          A generalized graph which consists of an ArchetypeVertex set and an ArchetypeEdge set.
ArchetypeVertex
          A interface for vertex implementations in generalized graphs.
Element
          An interface for elements (vertices and edges) of generalized graphs.
 

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.graph.filters
Edge
          A specific type of ArchetypeEdge that connects exactly two instances of Vertex.
Graph
          A specific type of ArchetypeGraph which consists of a Vertex set and an Edge set.
Vertex
          A specific type of ArchetypeVertex that can be connected by instances of Edge.
 

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.graph.filters.impl
Edge
          A specific type of ArchetypeEdge that connects exactly two instances of Vertex.
Graph
          A specific type of ArchetypeGraph which consists of a Vertex set and an Edge set.
Vertex
          A specific type of ArchetypeVertex that can be connected by instances of Edge.
 

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.graph.impl
ArchetypeEdge
          A interface for edge implementations in generalized graphs.
ArchetypeGraph
          A generalized graph which consists of an ArchetypeVertex set and an ArchetypeEdge set.
ArchetypeVertex
          A interface for vertex implementations in generalized graphs.
DirectedEdge
          A type of Edge which imposes an ordering on its incident vertices.
DirectedGraph
          A tagging interface for implementations of Graph whose edge set consists of implementations of DirectedEdge.
Edge
          A specific type of ArchetypeEdge that connects exactly two instances of Vertex.
Element
          An interface for elements (vertices and edges) of generalized graphs.
Graph
          A specific type of ArchetypeGraph which consists of a Vertex set and an Edge set.
Hyperedge
          An element of a Hypergraph that connects to zero or more Hypervertices.
Hypergraph
          A Hypergraph consists of hypervertices and hyperedges.
Hypervertex
          An element of a Hypergraph that connects to zero or more Hyperedges.
KPartiteGraph
          An interface for k-partite graphs.
UndirectedEdge
          A tagging interface for implementations of Edge that do not impose an ordering on their incident vertices.
UndirectedGraph
          A tagging interface for implementations of Graph whose edge set consists of implementations of UndirectedEdge.
Vertex
          A specific type of ArchetypeVertex that can be connected by instances of Edge.
 

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.graph.predicates
ArchetypeEdge
          A interface for edge implementations in generalized graphs.
ArchetypeGraph
          A generalized graph which consists of an ArchetypeVertex set and an ArchetypeEdge set.
ArchetypeVertex
          A interface for vertex implementations in generalized graphs.
DirectedEdge
          A type of Edge which imposes an ordering on its incident vertices.
Edge
          A specific type of ArchetypeEdge that connects exactly two instances of Vertex.
UndirectedEdge
          A tagging interface for implementations of Edge that do not impose an ordering on their incident vertices.
 

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.io
ArchetypeVertex
          A interface for vertex implementations in generalized graphs.
Edge
          A specific type of ArchetypeEdge that connects exactly two instances of Vertex.
Graph
          A specific type of ArchetypeGraph which consists of a Vertex set and an Edge set.
Hypergraph
          A Hypergraph consists of hypervertices and hyperedges.
KPartiteGraph
          An interface for k-partite graphs.
Vertex
          A specific type of ArchetypeVertex that can be connected by instances of Edge.
 

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.random.generators
ArchetypeGraph
          A generalized graph which consists of an ArchetypeVertex set and an ArchetypeEdge set.
Graph
          A specific type of ArchetypeGraph which consists of a Vertex set and an Edge set.
Vertex
          A specific type of ArchetypeVertex that can be connected by instances of Edge.
 

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.random.permuters
Graph
          A specific type of ArchetypeGraph which consists of a Vertex set and an Edge set.
 

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.statistics
ArchetypeGraph
          A generalized graph which consists of an ArchetypeVertex set and an ArchetypeEdge set.
 

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.utils
ArchetypeGraph
          A generalized graph which consists of an ArchetypeVertex set and an ArchetypeEdge set.
ArchetypeVertex
          A interface for vertex implementations in generalized graphs.
DirectedGraph
          A tagging interface for implementations of Graph whose edge set consists of implementations of DirectedEdge.
Edge
          A specific type of ArchetypeEdge that connects exactly two instances of Vertex.
Graph
          A specific type of ArchetypeGraph which consists of a Vertex set and an Edge set.
Hypergraph
          A Hypergraph consists of hypervertices and hyperedges.
UndirectedGraph
          A tagging interface for implementations of Graph whose edge set consists of implementations of UndirectedEdge.
Vertex
          A specific type of ArchetypeVertex that can be connected by instances of Edge.
 

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.visualization
ArchetypeEdge
          A interface for edge implementations in generalized graphs.
ArchetypeVertex
          A interface for vertex implementations in generalized graphs.
Edge
          A specific type of ArchetypeEdge that connects exactly two instances of Vertex.
Graph
          A specific type of ArchetypeGraph which consists of a Vertex set and an Edge set.
Vertex
          A specific type of ArchetypeVertex that can be connected by instances of Edge.
 

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.visualization.contrib
Graph
          A specific type of ArchetypeGraph which consists of a Vertex set and an Edge set.
Vertex
          A specific type of ArchetypeVertex that can be connected by instances of Edge.
 

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.visualization.control
Edge
          A specific type of ArchetypeEdge that connects exactly two instances of Vertex.
Vertex
          A specific type of ArchetypeVertex that can be connected by instances of Edge.
 

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.visualization.graphdraw
Edge
          A specific type of ArchetypeEdge that connects exactly two instances of Vertex.
Vertex
          A specific type of ArchetypeVertex that can be connected by instances of Edge.
 

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.visualization.subLayout
ArchetypeVertex
          A interface for vertex implementations in generalized graphs.
Vertex
          A specific type of ArchetypeVertex that can be connected by instances of Edge.
 

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.visualization.transform.shape
ArchetypeEdge
          A interface for edge implementations in generalized graphs.
ArchetypeVertex
          A interface for vertex implementations in generalized graphs.
Edge
          A specific type of ArchetypeEdge that connects exactly two instances of Vertex.
Vertex
          A specific type of ArchetypeVertex that can be connected by instances of Edge.
 

Classes in edu.uci.ics.jung.graph used by samples.graph
ArchetypeVertex
          A interface for vertex implementations in generalized graphs.
Edge
          A specific type of ArchetypeEdge that connects exactly two instances of Vertex.
Graph
          A specific type of ArchetypeGraph which consists of a Vertex set and an Edge set.
Vertex
          A specific type of ArchetypeVertex that can be connected by instances of Edge.
 

Classes in edu.uci.ics.jung.graph used by samples.graph.southern
KPartiteGraph
          An interface for k-partite graphs.
 

Classes in edu.uci.ics.jung.graph used by samples.preview_new_graphdraw
Edge
          A specific type of ArchetypeEdge that connects exactly two instances of Vertex.
Vertex
          A specific type of ArchetypeVertex that can be connected by instances of Edge.
 

Classes in edu.uci.ics.jung.graph used by samples.preview_new_graphdraw.event
Element
          An interface for elements (vertices and edges) of generalized graphs.
 

Classes in edu.uci.ics.jung.graph used by samples.preview_new_graphdraw.impl
Edge
          A specific type of ArchetypeEdge that connects exactly two instances of Vertex.
Graph
          A specific type of ArchetypeGraph which consists of a Vertex set and an Edge set.
Vertex
          A specific type of ArchetypeVertex that can be connected by instances of Edge.
 

Classes in edu.uci.ics.jung.graph used by samples.preview_new_graphdraw.impl.crooked
Edge
          A specific type of ArchetypeEdge that connects exactly two instances of Vertex.
 

Classes in edu.uci.ics.jung.graph used by samples.preview_new_graphdraw.iter
Edge
          A specific type of ArchetypeEdge that connects exactly two instances of Vertex.
Graph
          A specific type of ArchetypeGraph which consists of a Vertex set and an Edge set.
Vertex
          A specific type of ArchetypeVertex that can be connected by instances of Edge.
 

Classes in edu.uci.ics.jung.graph used by samples.preview_new_graphdraw.iterablelayouts
Edge
          A specific type of ArchetypeEdge that connects exactly two instances of Vertex.
Vertex
          A specific type of ArchetypeVertex that can be connected by instances of Edge.
 

Classes in edu.uci.ics.jung.graph used by samples.preview_new_graphdraw.staticlayouts
Graph
          A specific type of ArchetypeGraph which consists of a Vertex set and an Edge set.
Vertex
          A specific type of ArchetypeVertex that can be connected by instances of Edge.
 

Classes in edu.uci.ics.jung.graph used by samples.preview_new_graphdraw.test
Edge
          A specific type of ArchetypeEdge that connects exactly two instances of Vertex.
 

Classes in edu.uci.ics.jung.graph used by scratch.danyel
Edge
          A specific type of ArchetypeEdge that connects exactly two instances of Vertex.
Graph
          A specific type of ArchetypeGraph which consists of a Vertex set and an Edge set.
KPartiteGraph
          An interface for k-partite graphs.
Vertex
          A specific type of ArchetypeVertex that can be connected by instances of Edge.
 

Classes in edu.uci.ics.jung.graph used by scratch.danyel.lazy
ArchetypeVertex
          A interface for vertex implementations in generalized graphs.
Edge
          A specific type of ArchetypeEdge that connects exactly two instances of Vertex.
Element
          An interface for elements (vertices and edges) of generalized graphs.
Graph
          A specific type of ArchetypeGraph which consists of a Vertex set and an Edge set.
Vertex
          A specific type of ArchetypeVertex that can be connected by instances of Edge.
 

Classes in edu.uci.ics.jung.graph used by scratch.danyel.sample
ArchetypeVertex
          A interface for vertex implementations in generalized graphs.
Edge
          A specific type of ArchetypeEdge that connects exactly two instances of Vertex.
Graph
          A specific type of ArchetypeGraph which consists of a Vertex set and an Edge set.
Vertex
          A specific type of ArchetypeVertex that can be connected by instances of Edge.
 

Classes in edu.uci.ics.jung.graph used by scratch.joshua.ranking
ArchetypeEdge
          A interface for edge implementations in generalized graphs.
ArchetypeGraph
          A generalized graph which consists of an ArchetypeVertex set and an ArchetypeEdge set.
ArchetypeVertex
          A interface for vertex implementations in generalized graphs.
Graph
          A specific type of ArchetypeGraph which consists of a Vertex set and an Edge set.
 

Classes in edu.uci.ics.jung.graph used by scratch.scott
ArchetypeGraph
          A generalized graph which consists of an ArchetypeVertex set and an ArchetypeEdge set.
ArchetypeVertex
          A interface for vertex implementations in generalized graphs.
DirectedGraph
          A tagging interface for implementations of Graph whose edge set consists of implementations of DirectedEdge.
Edge
          A specific type of ArchetypeEdge that connects exactly two instances of Vertex.
Graph
          A specific type of ArchetypeGraph which consists of a Vertex set and an Edge set.
Vertex
          A specific type of ArchetypeVertex that can be connected by instances of Edge.
 

Classes in edu.uci.ics.jung.graph used by scratch.scott.partition
ArchetypeGraph
          A generalized graph which consists of an ArchetypeVertex set and an ArchetypeEdge set.
 

Classes in edu.uci.ics.jung.graph used by scratch.scott.registry
Graph
          A specific type of ArchetypeGraph which consists of a Vertex set and an Edge set.
 

Classes in edu.uci.ics.jung.graph used by test.edu.uci.ics.jung.algorithms.cluster
Graph
          A specific type of ArchetypeGraph which consists of a Vertex set and an Edge set.
Vertex
          A specific type of ArchetypeVertex that can be connected by instances of Edge.
 

Classes in edu.uci.ics.jung.graph used by test.edu.uci.ics.jung.algorithms.importance
ArchetypeVertex
          A interface for vertex implementations in generalized graphs.
Graph
          A specific type of ArchetypeGraph which consists of a Vertex set and an Edge set.
Vertex
          A specific type of ArchetypeVertex that can be connected by instances of Edge.
 

Classes in edu.uci.ics.jung.graph used by test.edu.uci.ics.jung.algorithms.shortestpath
Edge
          A specific type of ArchetypeEdge that connects exactly two instances of Vertex.
Graph
          A specific type of ArchetypeGraph which consists of a Vertex set and an Edge set.
 

Classes in edu.uci.ics.jung.graph used by test.edu.uci.ics.jung.graph.impl
Graph
          A specific type of ArchetypeGraph which consists of a Vertex set and an Edge set.
Vertex
          A specific type of ArchetypeVertex that can be connected by instances of Edge.
 

Classes in edu.uci.ics.jung.graph used by test.edu.uci.ics.jung.graph.predicates
Graph
          A specific type of ArchetypeGraph which consists of a Vertex set and an Edge set.
 

Classes in edu.uci.ics.jung.graph used by test.edu.uci.ics.jung.io
DirectedGraph
          A tagging interface for implementations of Graph whose edge set consists of implementations of DirectedEdge.
 

Classes in edu.uci.ics.jung.graph used by test.edu.uci.ics.jung.visualization
Graph
          A specific type of ArchetypeGraph which consists of a Vertex set and an Edge set.