Uses of Package
edu.uci.ics.jung.graph
Packages that use edu.uci.ics.jung.graph
Package
Description
Support for establishing and maintaining graph element equivalence (such as in blockmodeling).
Mechanisms for identifying clusters in graphs.
Filtering mechanisms that produce subgraphs of an original graph.
Methods for calculating properties relating to network flows (such as max flow/min cut).
Methods for generating new (often random) graphs with various properties.
Methods for generating random graphs with various properties.
Algorithms for assigning 2D coordinates (typically used for graph visualizations)
to vertices.
Specialized measures for graph properties.
Mechanisms for assigning values (denoting significance, influence, centrality, etc.)
to graph elements based on topological properties.
Utility functions for assigning scores to graph elements.
Provides interfaces and classes for calculating (geodesic) distances and shortest paths.
Mechanisms for graph transformation.
Provides general algorithmic utilities.
Interfaces for the JUNG graph types, and some representative implementations.
Support for generating events in response to graph actions, especially mutations.
Utility interfaces and classes for the JUNG API.
Interfaces and classes for reading and writing graphs in various (file)
formats.
Sample applications created using JUNG, largely focused on visualization.
Frameworks and mechanisms for visualizing JUNG graphs using Swing/AWT.
Mechanisms for associating data (shapes, colors, values, strings, etc.) with
graph elements.
Visualization mechanisms related to graph layout: caching, persistence,
event-emitting, etc.
Visualization mechanisms for supporting the selection of graph elements.
Visualization mechanisms relating to grouping or hiding specified element sets.
Utilities for graph visualization.
-
Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.blockmodelClassDescriptionA graph consisting of a set of vertices of type
V
set and a set of edges of typeE
. -
Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.clusterClassDescriptionA graph consisting of a set of vertices of type
V
set and a set of edges of typeE
.A tagging interface for extensions ofGraph
that accept only undirected edges. -
Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.filtersClassDescriptionA graph consisting of a set of vertices of type
V
set and a set of edges of typeE
.A hypergraph, consisting of a set of vertices of typeV
and a set of hyperedges of typeE
which connect the vertices. -
Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.flowsClassDescriptionA 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.generatorsClassDescriptionA graph consisting of a set of vertices of type
V
set and a set of edges of typeE
. -
Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.generators.randomClassDescriptionA graph consisting of a set of vertices of type
V
set and a set of edges of typeE
.A tagging interface for extensions ofGraph
that accept only undirected edges. -
Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.importanceClassDescriptionA tagging interface for implementations of
Graph
that accept only directed edges.A graph consisting of a set of vertices of typeV
set and a set of edges of typeE
. -
Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.layout
-
Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.metricsClassDescriptionA tagging interface for implementations of
Graph
that accept only directed edges.A graph consisting of a set of vertices of typeV
set and a set of edges of typeE
. -
Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.scoringClassDescriptionA graph consisting of a set of vertices of type
V
set and a set of edges of typeE
.A hypergraph, consisting of a set of vertices of typeV
and a set of hyperedges of typeE
which connect the vertices. -
Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.scoring.utilClassDescriptionA graph consisting of a set of vertices of type
V
set and a set of edges of typeE
.A hypergraph, consisting of a set of vertices of typeV
and a set of hyperedges of typeE
which connect the vertices. -
Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.shortestpathClassDescriptionAn interface for a graph which consists of a collection of rooted directed acyclic graphs.A graph consisting of a set of vertices of type
V
set and a set of edges of typeE
.A hypergraph, consisting of a set of vertices of typeV
and a set of hyperedges of typeE
which connect the vertices. -
Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.transformationClassDescriptionA tagging interface for implementations of
Graph
that accept only directed edges.A graph consisting of a set of vertices of typeV
set and a set of edges of typeE
.A hypergraph, consisting of a set of vertices of typeV
and a set of hyperedges of typeE
which connect the vertices.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.A tagging interface for extensions ofGraph
that accept only undirected edges. -
Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.utilClassDescriptionA graph consisting of a set of vertices of type
V
set and a set of edges of typeE
. -
Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.graphClassDescriptionAbstract implementation of the
Graph
interface.An abstract class for graphs whose edges all have the sameEdgeType
.A tagging interface for implementations ofGraph
that accept only directed edges.An implementation ofDirectedGraph
, suitable for sparse graphs, that permits parallel edges.An interface for a graph which consists of a collection of rooted directed acyclic graphs.A graph consisting of a set of vertices of typeV
set and a set of edges of typeE
.An implementation ofGraph
that delegates its method calls to a constructor-specifiedGraph
instance.A hypergraph, consisting of a set of vertices of typeV
and a set of hyperedges of typeE
which connect the vertices.A tagging interface which indicates that the implementing graph accepts parallel edges.An implementation ofGraph
that orders its vertex and edge collections according to insertion time, is suitable for sparse graphs, and permits directed, undirected, and parallel edges.An implementation ofGraph
that is suitable for sparse graphs and permits directed, undirected, and parallel edges.A subtype ofGraph
which is a (directed, rooted) tree.A tagging interface for extensions ofGraph
that accept only undirected edges.An implementation ofUndirectedGraph
that is suitable for sparse graphs and permits parallel edges. -
Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.graph.eventClassDescriptionA graph consisting of a set of vertices of type
V
set and a set of edges of typeE
. -
Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.graph.utilClassDescriptionA tagging interface for implementations of
Graph
that accept only directed edges.An interface for a graph which consists of a collection of rooted directed acyclic graphs.A graph consisting of a set of vertices of typeV
set and a set of edges of typeE
.A hypergraph, consisting of a set of vertices of typeV
and a set of hyperedges of typeE
which connect the vertices.A subtype ofGraph
which is a (directed, rooted) tree.A tagging interface for extensions ofGraph
that accept only undirected edges. -
Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.ioClassDescriptionA graph consisting of a set of vertices of type
V
set and a set of edges of typeE
.A hypergraph, consisting of a set of vertices of typeV
and a set of hyperedges of typeE
which connect the vertices. -
Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.io.graphmlClassDescriptionA hypergraph, consisting of a set of vertices of type
V
and a set of hyperedges of typeE
which connect the vertices. -
Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.io.graphml.parserClassDescriptionA hypergraph, consisting of a set of vertices of type
V
and a set of hyperedges of typeE
which connect the vertices. -
Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.samplesClassDescriptionA tagging interface for implementations of
Graph
that accept only directed edges.An implementation ofDirectedGraph
suitable for sparse graphs.An implementation ofDirectedGraph
, suitable for sparse graphs, that permits parallel edges.An interface for a graph which consists of a collection of rooted directed acyclic graphs.A graph consisting of a set of vertices of typeV
set and a set of edges of typeE
.A subtype ofGraph
which is a (directed, rooted) tree. -
Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.visualizationClassDescriptionA graph consisting of a set of vertices of type
V
set and a set of edges of typeE
. -
Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.visualization.decoratorsClassDescriptionA graph consisting of a set of vertices of type
V
set and a set of edges of typeE
. -
Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.visualization.layoutClassDescriptionA graph consisting of a set of vertices of type
V
set and a set of edges of typeE
. -
Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.visualization.pickingClassDescriptionA graph consisting of a set of vertices of type
V
set and a set of edges of typeE
. -
Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.visualization.spatialClassDescriptionA graph consisting of a set of vertices of type
V
set and a set of edges of typeE
.A hypergraph, consisting of a set of vertices of typeV
and a set of hyperedges of typeE
which connect the vertices. -
Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.visualization.subLayout
-
Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.visualization.utilClassDescriptionA graph consisting of a set of vertices of type
V
set and a set of edges of typeE
.