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

Packages that use edu.uci.ics.jung.graph

edu.uci.ics.jung.algorithms.blockmodel	Support for establishing and maintaining graph element equivalence (such as in blockmodeling).
edu.uci.ics.jung.algorithms.cluster	Mechanisms for identifying clusters in graphs.
edu.uci.ics.jung.algorithms.filters	Filtering mechanisms that produce subgraphs of an original graph.
edu.uci.ics.jung.algorithms.flows	Methods for calculating properties relating to network flows (such as max flow/min cut).
edu.uci.ics.jung.algorithms.generators	Methods for generating new (often random) graphs with various properties.
edu.uci.ics.jung.algorithms.generators.random	Methods for generating random graphs with various properties.
edu.uci.ics.jung.algorithms.importance
edu.uci.ics.jung.algorithms.layout	Algorithms for assigning 2D coordinates (typically used for graph visualizations) to vertices.
edu.uci.ics.jung.algorithms.matrix	Mechanisms for dealing with graphs as matrices.
edu.uci.ics.jung.algorithms.metrics	Specialized measures for graph properties.
edu.uci.ics.jung.algorithms.scoring	Mechanisms for assigning values (denoting significance, influence, centrality, etc.) to graph elements based on topological properties.
edu.uci.ics.jung.algorithms.scoring.util	Utility functions for assigning scores to graph elements.
edu.uci.ics.jung.algorithms.shortestpath	Provides interfaces and classes for calculating (geodesic) distances and shortest paths.
edu.uci.ics.jung.algorithms.transformation	Mechanisms for graph transformation.
edu.uci.ics.jung.algorithms.util	Provides general algorithmic utilities.
edu.uci.ics.jung.graph	Interfaces for the JUNG graph types, and some representative implementations.
edu.uci.ics.jung.graph.event	Support for generating events in response to graph actions, especially mutations.
edu.uci.ics.jung.graph.util	Utility interfaces and classes for the JUNG API.
edu.uci.ics.jung.io	Interfaces and classes for reading and writing graphs in various (file) formats.
edu.uci.ics.jung.io.graphml
edu.uci.ics.jung.io.graphml.parser
edu.uci.ics.jung.samples	Sample applications created using JUNG, largely focused on visualization.
edu.uci.ics.jung.visualization	Frameworks and mechanisms for visualizing JUNG graphs using Swing/AWT.
edu.uci.ics.jung.visualization.decorators	Mechanisms for associating data (shapes, colors, values, strings, etc.) with graph elements.
edu.uci.ics.jung.visualization.layout	Visualization mechanisms related to graph layout: caching, persistence, event-emitting, etc.
edu.uci.ics.jung.visualization.picking	Visualization mechanisms for supporting the selection of graph elements.
edu.uci.ics.jung.visualization.subLayout	Visualization mechanisms relating to grouping or hiding specified element sets.
edu.uci.ics.jung.visualization.util	Utilities for graph visualization.
edu.uci.ics.jung.visualization3d.layout

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.blockmodel

Graph
A graph consisting of a set of vertices of type V set and a set of edges of type E.

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.cluster

Graph
A graph consisting of a set of vertices of type V set and a set of edges of type E.

UndirectedGraph
A tagging interface for extensions of Graph that accept only undirected edges.

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.filters

Graph
A graph consisting of a set of vertices of type V set and a set of edges of type E.

Hypergraph
A hypergraph, consisting of a set of vertices of type V and a set of hyperedges of type E which connect the vertices.

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.flows

DirectedGraph
A tagging interface for implementations of Graph that accept only directed edges.

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.generators

Graph
A graph consisting of a set of vertices of type V set and a set of edges of type E.

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.generators.random

Graph
A graph consisting of a set of vertices of type V set and a set of edges of type E.

UndirectedGraph
A tagging interface for extensions of Graph that accept only undirected edges.

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.importance

DirectedGraph
A tagging interface for implementations of Graph that accept only directed edges.

Graph
A graph consisting of a set of vertices of type V set and a set of edges of type E.

UndirectedGraph
A tagging interface for extensions of Graph that accept only undirected edges.

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.layout

Forest
An interface for a graph which consists of a collection of rooted directed acyclic graphs.

Graph
A graph consisting of a set of vertices of type V set and a set of edges of type E.

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.matrix

Graph
A graph consisting of a set of vertices of type V set and a set of edges of type E.

UndirectedGraph
A tagging interface for extensions of Graph that accept only undirected edges.

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.metrics

DirectedGraph
A tagging interface for implementations of Graph that accept only directed edges.

Graph
A graph consisting of a set of vertices of type V set and a set of edges of type E.

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.scoring

Graph
A graph consisting of a set of vertices of type V set and a set of edges of type E.

Hypergraph
A hypergraph, consisting of a set of vertices of type V and a set of hyperedges of type E which connect the vertices.

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.scoring.util

Graph
A graph consisting of a set of vertices of type V set and a set of edges of type E.

Hypergraph
A hypergraph, consisting of a set of vertices of type V and a set of hyperedges of type E which connect the vertices.

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.shortestpath

Forest
An interface for a graph which consists of a collection of rooted directed acyclic graphs.

Graph
A graph consisting of a set of vertices of type V set and a set of edges of type E.

Hypergraph
A hypergraph, consisting of a set of vertices of type V and a set of hyperedges of type E which connect the vertices.

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.transformation

DirectedGraph
A tagging interface for implementations of Graph that accept only directed edges.

Graph
A graph consisting of a set of vertices of type V set and a set of edges of type E.

Hypergraph
A hypergraph, consisting of a set of vertices of type V and a set of hyperedges of type E which connect the vertices.

KPartiteGraph
An interface for graphs whose vertices are each members of one of 2 or more disjoint sets (partitions), and whose edges connect only vertices in distinct partitions.

UndirectedGraph
A tagging interface for extensions of Graph that accept only undirected edges.

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.util

Graph
A graph consisting of a set of vertices of type V set and a set of edges of type E.

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.graph

AbstractGraph
Abstract implementation of the Graph interface.

AbstractTypedGraph
An abstract class for graphs whose edges all have the same EdgeType.

DirectedGraph
A tagging interface for implementations of Graph that accept only directed edges.

DirectedSparseMultigraph
An implementation of DirectedGraph, suitable for sparse graphs, that permits parallel edges.

Forest
An interface for a graph which consists of a collection of rooted directed acyclic graphs.

Graph
A graph consisting of a set of vertices of type V set and a set of edges of type E.

GraphDecorator
An implementation of Graph that delegates its method calls to a constructor-specified Graph instance.

Hypergraph
A hypergraph, consisting of a set of vertices of type V and a set of hyperedges of type E which connect the vertices.

MultiGraph
A tagging interface which indicates that the implementing graph accepts parallel edges.

OrderedKAryTree.VertexData

OrderedSparseMultigraph
An implementation of Graph that orders its vertex and edge collections according to insertion time, is suitable for sparse graphs, and permits directed, undirected, and parallel edges.

SparseMultigraph
An implementation of Graph that is suitable for sparse graphs and permits directed, undirected, and parallel edges.

Tree
A subtype of Graph which is a (directed, rooted) tree.

UndirectedGraph
A tagging interface for extensions of Graph that accept only undirected edges.

UndirectedSparseMultigraph
An implementation of UndirectedGraph that is suitable for sparse graphs and permits parallel edges.

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.graph.event

Graph
A graph consisting of a set of vertices of type V set and a set of edges of type E.

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.graph.util

DirectedGraph
A tagging interface for implementations of Graph that accept only directed edges.

Forest
An interface for a graph which consists of a collection of rooted directed acyclic graphs.

Graph
A graph consisting of a set of vertices of type V set and a set of edges of type E.

Tree
A subtype of Graph which is a (directed, rooted) tree.

UndirectedGraph
A tagging interface for extensions of Graph that accept only undirected edges.

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.io

Graph
A graph consisting of a set of vertices of type V set and a set of edges of type E.

Hypergraph
A hypergraph, consisting of a set of vertices of type V and a set of hyperedges of type E which connect the vertices.

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.io.graphml

Hypergraph
A hypergraph, consisting of a set of vertices of type V and a set of hyperedges of type E which connect the vertices.

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.io.graphml.parser

Hypergraph
A hypergraph, consisting of a set of vertices of type V and a set of hyperedges of type E which connect the vertices.

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.samples

Graph
A graph consisting of a set of vertices of type V set and a set of edges of type E.

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.visualization

Graph
A graph consisting of a set of vertices of type V set and a set of edges of type E.

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.visualization.decorators

Graph
A graph consisting of a set of vertices of type V set and a set of edges of type E.

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.visualization.layout

Graph
A graph consisting of a set of vertices of type V set and a set of edges of type E.

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.visualization.picking

Graph
A graph consisting of a set of vertices of type V set and a set of edges of type E.

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.visualization.subLayout

Forest
An interface for a graph which consists of a collection of rooted directed acyclic graphs.

Graph
A graph consisting of a set of vertices of type V set and a set of edges of type E.

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.visualization.util

Graph
A graph consisting of a set of vertices of type V set and a set of edges of type E.

Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.visualization3d.layout

Graph
A graph consisting of a set of vertices of type V set and a set of edges of type E.