Uses of Package
edu.uci.ics.jung.graph
-
Packages that use edu.uci.ics.jung.graph Package Description 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.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.spatial 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. -
Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.blockmodel Class Description Graph 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.cluster Class Description Graph A graph consisting of a set of vertices of typeV
set and a set of edges of typeE
.UndirectedGraph 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.filters Class Description Graph A graph consisting of a set of vertices of typeV
set and a set of edges of typeE
.Hypergraph 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.flows Class Description DirectedGraph A tagging interface for implementations ofGraph
that accept only directed edges. -
Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.generators Class Description Graph 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.generators.random Class Description Graph A graph consisting of a set of vertices of typeV
set and a set of edges of typeE
.UndirectedGraph 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.importance Class Description DirectedGraph A tagging interface for implementations ofGraph
that accept only directed edges.Graph 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 Class Description 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 typeV
set and a set of edges of typeE
. -
Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.metrics Class Description DirectedGraph A tagging interface for implementations ofGraph
that accept only directed edges.Graph 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.scoring Class Description Graph A graph consisting of a set of vertices of typeV
set and a set of edges of typeE
.Hypergraph 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.util Class Description Graph A graph consisting of a set of vertices of typeV
set and a set of edges of typeE
.Hypergraph 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.shortestpath Class Description 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 typeV
set and a set of edges of typeE
.Hypergraph 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.transformation Class Description DirectedGraph A tagging interface for implementations ofGraph
that accept only directed edges.Graph A graph consisting of a set of vertices of typeV
set and a set of edges of typeE
.Hypergraph A hypergraph, consisting of a set of vertices of typeV
and a set of hyperedges of typeE
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 ofGraph
that accept only undirected edges. -
Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.algorithms.util Class Description Graph 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.graph Class Description AbstractGraph Abstract implementation of theGraph
interface.AbstractTypedGraph An abstract class for graphs whose edges all have the sameEdgeType
.DirectedGraph A tagging interface for implementations ofGraph
that accept only directed edges.DirectedSparseMultigraph An implementation ofDirectedGraph
, 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 typeV
set and a set of edges of typeE
.GraphDecorator An implementation ofGraph
that delegates its method calls to a constructor-specifiedGraph
instance.Hypergraph A hypergraph, consisting of a set of vertices of typeV
and a set of hyperedges of typeE
which connect the vertices.MultiGraph A tagging interface which indicates that the implementing graph accepts parallel edges.OrderedKAryTree.VertexData OrderedSparseMultigraph 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.SparseMultigraph An implementation ofGraph
that is suitable for sparse graphs and permits directed, undirected, and parallel edges.Tree A subtype ofGraph
which is a (directed, rooted) tree.UndirectedGraph A tagging interface for extensions ofGraph
that accept only undirected edges.UndirectedSparseMultigraph 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.event Class Description Graph 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.graph.util Class Description DirectedGraph A tagging interface for implementations ofGraph
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 typeV
set and a set of edges of typeE
.Hypergraph A hypergraph, consisting of a set of vertices of typeV
and a set of hyperedges of typeE
which connect the vertices.Tree A subtype ofGraph
which is a (directed, rooted) tree.UndirectedGraph A tagging interface for extensions ofGraph
that accept only undirected edges. -
Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.io Class Description Graph A graph consisting of a set of vertices of typeV
set and a set of edges of typeE
.Hypergraph 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.graphml Class Description Hypergraph 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.graphml.parser Class Description Hypergraph 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.samples Class Description DirectedGraph A tagging interface for implementations ofGraph
that accept only directed edges.DirectedSparseGraph An implementation ofDirectedGraph
suitable for sparse graphs.DirectedSparseMultigraph An implementation ofDirectedGraph
, 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 typeV
set and a set of edges of typeE
.Tree A subtype ofGraph
which is a (directed, rooted) tree. -
Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.visualization Class Description Graph 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.visualization.decorators Class Description Graph 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.visualization.layout Class Description Graph 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.visualization.picking Class Description Graph 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.visualization.spatial Class Description Graph A graph consisting of a set of vertices of typeV
set and a set of edges of typeE
.Hypergraph 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 Class Description 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 typeV
set and a set of edges of typeE
. -
Classes in edu.uci.ics.jung.graph used by edu.uci.ics.jung.visualization.util Class Description Graph A graph consisting of a set of vertices of typeV
set and a set of edges of typeE
.