Uses of Interface
edu.uci.ics.jung.graph.Graph
Packages that use 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 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.
-
Uses of Graph in edu.uci.ics.jung.algorithms.blockmodel
Fields in edu.uci.ics.jung.algorithms.blockmodel declared as GraphMethods in edu.uci.ics.jung.algorithms.blockmodel that return GraphModifier and TypeMethodDescriptionVertexPartition.getGraph()
Returns the graph on which the partition is defined.Methods in edu.uci.ics.jung.algorithms.blockmodel with parameters of type GraphModifier and TypeMethodDescriptionStructurallyEquivalent.getEquivalentPairs
(Graph<V, ?> g) For each vertex pair v, v1 in G, checks whether v and v1 are fully equivalent: meaning that they connect to the exact same vertices.protected boolean
StructurallyEquivalent.isStructurallyEquivalent
(Graph<V, ?> g, V v1, V v2) Constructors in edu.uci.ics.jung.algorithms.blockmodel with parameters of type GraphModifierConstructorDescriptionVertexPartition
(Graph<V, E> g, Collection<Set<V>> vertex_sets) Creates an instance based on the specified graph and set of disjoint vertex sets, and generates a vertex-to-partition map based on these sets.Creates an instance based on the specified graph and mapping from vertices to vertex sets, and generates a set of partitions based on this mapping.Creates an instance based on the specified graph, vertex-set mapping, and set of disjoint vertex sets. -
Uses of Graph in edu.uci.ics.jung.algorithms.cluster
Fields in edu.uci.ics.jung.algorithms.cluster declared as GraphMethods in edu.uci.ics.jung.algorithms.cluster with parameters of type GraphModifier and TypeMethodDescriptionFinds the set of clusters which have the strongest "community structure".Extracts the weak components from a graph.Constructors in edu.uci.ics.jung.algorithms.cluster with parameters of type GraphModifierConstructorDescriptionVoltageClusterer
(Graph<V, E> g, int num_candidates) Creates an instance of a VoltageCluster with the specified parameters. -
Uses of Graph in edu.uci.ics.jung.algorithms.filters
Methods in edu.uci.ics.jung.algorithms.filters that return GraphModifier and TypeMethodDescriptionConstructs an unassembled graph containing the k-neighborhood around the root node(s).Methods in edu.uci.ics.jung.algorithms.filters with parameters of type Graph -
Uses of Graph in edu.uci.ics.jung.algorithms.generators
Fields in edu.uci.ics.jung.algorithms.generators with type parameters of type GraphMethods in edu.uci.ics.jung.algorithms.generators that return GraphModifier and TypeMethodDescriptionLattice2DGenerator.get()
Generates a graph based on the constructor-specified settings.Constructor parameters in edu.uci.ics.jung.algorithms.generators with type arguments of type GraphModifierConstructorDescriptionLattice2DGenerator
(com.google.common.base.Supplier<? extends Graph<V, E>> graph_factory, com.google.common.base.Supplier<V> vertex_factory, com.google.common.base.Supplier<E> edge_factory, int latticeSize, boolean isToroidal) Constructs a generator of square lattices of sizelatticeSize
with the specified parameters.Lattice2DGenerator
(com.google.common.base.Supplier<? extends Graph<V, E>> graph_factory, com.google.common.base.Supplier<V> vertex_factory, com.google.common.base.Supplier<E> edge_factory, int row_count, int col_count, boolean isToroidal) Creates a generator ofrow_count
xcol_count
lattices with the specified parameters. -
Uses of Graph in edu.uci.ics.jung.algorithms.generators.random
Fields in edu.uci.ics.jung.algorithms.generators.random declared as GraphFields in edu.uci.ics.jung.algorithms.generators.random with type parameters of type GraphModifier and TypeFieldDescriptionBarabasiAlbertGenerator.graphFactory
EppsteinPowerLawGenerator.graphFactory
Methods in edu.uci.ics.jung.algorithms.generators.random that return GraphModifier and TypeMethodDescriptionstatic <V,
E> Graph <V, E> MixedRandomGraphGenerator.generateMixedRandomGraph
(com.google.common.base.Supplier<Graph<V, E>> graphFactory, com.google.common.base.Supplier<V> vertexFactory, com.google.common.base.Supplier<E> edgeFactory, Map<E, Number> edge_weights, int num_vertices, Set<V> seedVertices) Returns a random mixed-mode graph.BarabasiAlbertGenerator.get()
EppsteinPowerLawGenerator.get()
Generates a graph whose degree distribution approximates a power-law.ErdosRenyiGenerator.get()
Returns a graph in which each pair of vertices is connected by an undirected edge with the probability specified by the constructor.KleinbergSmallWorldGenerator.get()
Generates a random small world network according to the parameters givenEppsteinPowerLawGenerator.initializeGraph()
Method parameters in edu.uci.ics.jung.algorithms.generators.random with type arguments of type GraphModifier and TypeMethodDescriptionstatic <V,
E> Graph <V, E> MixedRandomGraphGenerator.generateMixedRandomGraph
(com.google.common.base.Supplier<Graph<V, E>> graphFactory, com.google.common.base.Supplier<V> vertexFactory, com.google.common.base.Supplier<E> edgeFactory, Map<E, Number> edge_weights, int num_vertices, Set<V> seedVertices) Returns a random mixed-mode graph.Constructor parameters in edu.uci.ics.jung.algorithms.generators.random with type arguments of type GraphModifierConstructorDescriptionBarabasiAlbertGenerator
(com.google.common.base.Supplier<Graph<V, E>> graphFactory, com.google.common.base.Supplier<V> vertexFactory, com.google.common.base.Supplier<E> edgeFactory, int init_vertices, int numEdgesToAttach, int seed, Set<V> seedVertices) Constructs a new instance of the generator.BarabasiAlbertGenerator
(com.google.common.base.Supplier<Graph<V, E>> graphFactory, com.google.common.base.Supplier<V> vertexFactory, com.google.common.base.Supplier<E> edgeFactory, int init_vertices, int numEdgesToAttach, Set<V> seedVertices) Constructs a new instance of the generator, whose output will be an undirected graph, and which will use the current time as a seed for the random number generation.EppsteinPowerLawGenerator
(com.google.common.base.Supplier<Graph<V, E>> graphFactory, com.google.common.base.Supplier<V> vertexFactory, com.google.common.base.Supplier<E> edgeFactory, int numVertices, int numEdges, int r) Creates an instance with the specified factories and specifications.KleinbergSmallWorldGenerator
(com.google.common.base.Supplier<? extends Graph<V, E>> graphFactory, com.google.common.base.Supplier<V> vertexFactory, com.google.common.base.Supplier<E> edgeFactory, int latticeSize, double clusteringExponent) Creates an instance with the specified parameters, whose underlying lattice is (a) of sizelatticeSize
xlatticeSize
, and (b) toroidal.KleinbergSmallWorldGenerator
(com.google.common.base.Supplier<? extends Graph<V, E>> graphFactory, com.google.common.base.Supplier<V> vertexFactory, com.google.common.base.Supplier<E> edgeFactory, int row_count, int col_count, double clusteringExponent) Creates an instance with the specified parameters, whose underlying lattice is toroidal.KleinbergSmallWorldGenerator
(com.google.common.base.Supplier<? extends Graph<V, E>> graphFactory, com.google.common.base.Supplier<V> vertexFactory, com.google.common.base.Supplier<E> edgeFactory, int row_count, int col_count, double clusteringExponent, boolean isToroidal) Creates an instance with the specified parameters. -
Uses of Graph in edu.uci.ics.jung.algorithms.importance
Fields in edu.uci.ics.jung.algorithms.importance declared as GraphMethods in edu.uci.ics.jung.algorithms.importance that return GraphMethods in edu.uci.ics.jung.algorithms.importance with parameters of type GraphModifier and TypeMethodDescriptionprotected void
BetweennessCentrality.computeBetweenness
(Graph<V, E> graph) protected void
AbstractRanker.initialize
(Graph<V, E> graph, boolean isNodeRanker, boolean isEdgeRanker) private void
BetweennessCentrality.initializeData
(Graph<V, E> g, Map<V, BetweennessCentrality<V, E>.BetweennessData> decorator) Constructors in edu.uci.ics.jung.algorithms.importance with parameters of type GraphModifierConstructorDescriptionBetweennessCentrality
(Graph<V, E> g) Constructor which initializes the algorithmBetweennessCentrality
(Graph<V, E> g, boolean rankNodes) BetweennessCentrality
(Graph<V, E> g, boolean rankNodes, boolean rankEdges) -
Uses of Graph in edu.uci.ics.jung.algorithms.layout
Fields in edu.uci.ics.jung.algorithms.layout declared as GraphMethods in edu.uci.ics.jung.algorithms.layout that return GraphModifier and TypeMethodDescriptionAbstractLayout.getGraph()
AggregateLayout.getGraph()
Layout.getGraph()
LayoutDecorator.getGraph()
TreeLayout.getGraph()
Methods in edu.uci.ics.jung.algorithms.layout with parameters of type GraphModifier and TypeMethodDescriptionvoid
void
void
void
void
Constructors in edu.uci.ics.jung.algorithms.layout with parameters of type GraphModifierConstructorDescriptionprotected
AbstractLayout
(Graph<V, E> graph) Creates an instance forgraph
which does not initialize the vertex locations.protected
Creates an instance forgraph
which initializes the vertex locations usinginitializer
.protected
AbstractLayout
(Graph<V, E> graph, com.google.common.base.Function<V, Point2D> initializer, Dimension size) Creates an instance forgraph
which initializes the vertex locations usinginitializer
and sets the size of the layout tosize
.protected
AbstractLayout
(Graph<V, E> graph, Dimension size) Creates an instance forgraph
which sets the size of the layout tosize
.CircleLayout
(Graph<V, E> g) ISOMLayout
(Graph<V, E> g) Creates an instance for the specified graph and distance metric.SpringLayout
(Graph<V, E> g) Constructor for a SpringLayout for a raw graph with associated dimension--the input knows how big the graph is.Constructor for a SpringLayout for a raw graph with associated component.SpringLayout2
(Graph<V, E> g) Constructor for a SpringLayout for a raw graph with associated dimension--the input knows how big the graph is.Constructor for a SpringLayout for a raw graph with associated component.StaticLayout
(Graph<V, E> graph) StaticLayout
(Graph<V, E> graph, com.google.common.base.Function<V, Point2D> initializer, Dimension size) StaticLayout
(Graph<V, E> graph, Dimension size) -
Uses of Graph in edu.uci.ics.jung.algorithms.metrics
Fields in edu.uci.ics.jung.algorithms.metrics declared as GraphMethods in edu.uci.ics.jung.algorithms.metrics with parameters of type GraphModifier and TypeMethodDescriptionMetrics.clusteringCoefficients
(Graph<V, E> graph) Returns aMap
of vertices to their clustering coefficients.protected static <V,
E> boolean protected double
StructuralHoles.organizationalMeasure
(Graph<V, E> g, V v) A measure of the organization of individuals within the subgraph centered onv
.protected static <V,
E> boolean TriadicCensus.shouldCount
(Graph<V, E> g, List<V> id, V u, V v, V w) Return true iff this ordering is canonical and therefore we should build statistics for it.static <V,
E> int This is the core of the technique in the paper.Constructors in edu.uci.ics.jung.algorithms.metrics with parameters of type Graph -
Uses of Graph in edu.uci.ics.jung.algorithms.scoring
Fields in edu.uci.ics.jung.algorithms.scoring declared as GraphMethods in edu.uci.ics.jung.algorithms.scoring with parameters of type GraphModifier and TypeMethodDescriptionprotected void
BetweennessCentrality.initialize
(Graph<V, E> graph) Constructors in edu.uci.ics.jung.algorithms.scoring with parameters of type GraphModifierConstructorDescriptionBetweennessCentrality
(Graph<V, E> graph) Calculates betweenness scores based on the all-pairs unweighted shortest paths in the graph.BetweennessCentrality
(Graph<V, E> graph, com.google.common.base.Function<? super E, ? extends Number> edge_weights) Calculates betweenness scores based on the all-pairs weighted shortest paths in the graph.Creates an instance for the specified graph.Creates an instance for the specified graph and alpha (random jump probability) parameter.Creates an instance for the specified graph, edge weights, and alpha (random jump probability) parameter. -
Uses of Graph in edu.uci.ics.jung.algorithms.scoring.util
Fields in edu.uci.ics.jung.algorithms.scoring.util declared as GraphModifier and TypeFieldDescriptionUniformInOut.graph
The graph for which the edge weights are defined.Constructors in edu.uci.ics.jung.algorithms.scoring.util with parameters of type GraphModifierConstructorDescriptionUniformInOut
(Graph<V, E> graph) Creates an instance for the specified graph. -
Uses of Graph in edu.uci.ics.jung.algorithms.shortestpath
Fields in edu.uci.ics.jung.algorithms.shortestpath declared as GraphFields in edu.uci.ics.jung.algorithms.shortestpath with type parameters of type GraphMethods in edu.uci.ics.jung.algorithms.shortestpath that return GraphMethods in edu.uci.ics.jung.algorithms.shortestpath with parameters of type GraphModifier and TypeMethodDescriptionprotected V
static <V,
E> List <E> ShortestPathUtils.getPath
(Graph<V, E> graph, ShortestPath<V, E> sp, V source, V target) Returns aList
of the edges on the shortest path fromsource
totarget
, in order of their occurrence on this path.protected void
PrimMinimumSpanningTree.updateTree
(Graph<V, E> tree, Graph<V, E> graph, Collection<E> unfinishedEdges) Constructors in edu.uci.ics.jung.algorithms.shortestpath with parameters of type GraphModifierConstructorDescriptionDijkstraDistance
(Graph<V, E> g) Creates an instance ofDijkstraShortestPath
for the specified unweighted graph (that is, all weights 1) which caches results locally.DijkstraDistance
(Graph<V, E> g, boolean cached) Creates an instance ofDijkstraShortestPath
for the specified unweighted graph (that is, all weights 1) which caches results locally.DijkstraShortestPath
(Graph<V, E> g) Creates an instance ofDijkstraShortestPath
for the specified unweighted graph (that is, all weights 1) which caches results locally.DijkstraShortestPath
(Graph<V, E> g, boolean cached) Creates an instance ofDijkstraShortestPath
for the specified unweighted graph (that is, all weights 1) which caches results locally.Creates an instance ofDijkstraShortestPath
for the specified graph and the specified method of extracting weights from edges, which caches results locally.DijkstraShortestPath
(Graph<V, E> g, com.google.common.base.Function<E, ? extends Number> nev, boolean cached) Creates an instance ofDijkstraShortestPath
for the specified graph and the specified method of extracting weights from edges, which caches results locally if and only ifcached
istrue
.MinimumSpanningForest
(Graph<V, E> graph, com.google.common.base.Supplier<Forest<V, E>> Supplier, V root, Map<E, Double> weights) Creates a Forest from the supplied Graph and supplied Supplier, which is used to create a new, empty Forest.Creates a minimum spanning forest from the supplied graph, populating the supplied Forest, which must be empty.Creates a minimum spanning forest from the supplied graph, populating the supplied Forest, which must be empty.MinimumSpanningForest2
(Graph<V, E> graph, com.google.common.base.Supplier<Forest<V, E>> supplier, com.google.common.base.Supplier<? extends Graph<V, E>> treeFactory, com.google.common.base.Function<? super E, Double> weights) Create a Forest from the supplied Graph and supplied Supplier, which is used to create a new, empty Forest.MinimumSpanningForest2
(Graph<V, E> graph, Forest<V, E> forest, com.google.common.base.Supplier<? extends Graph<V, E>> treeFactory, com.google.common.base.Function<? super E, Double> weights) Create a forest from the supplied graph, populating the supplied Forest, which must be empty.Constructor parameters in edu.uci.ics.jung.algorithms.shortestpath with type arguments of type GraphModifierConstructorDescriptionMinimumSpanningForest2
(Graph<V, E> graph, Forest<V, E> forest, com.google.common.base.Supplier<? extends Graph<V, E>> treeFactory, com.google.common.base.Function<? super E, Double> weights) Create a forest from the supplied graph, populating the supplied Forest, which must be empty.PrimMinimumSpanningTree
(com.google.common.base.Supplier<? extends Graph<V, E>> supplier) Creates an instance which generates a minimum spanning tree assuming constant edge weights.PrimMinimumSpanningTree
(com.google.common.base.Supplier<? extends Graph<V, E>> supplier, com.google.common.base.Function<? super E, Double> weights) Creates an instance which generates a minimum spanning tree using the input edge weights. -
Uses of Graph in edu.uci.ics.jung.algorithms.transformation
Fields in edu.uci.ics.jung.algorithms.transformation with type parameters of type GraphMethods in edu.uci.ics.jung.algorithms.transformation that return GraphModifier and TypeMethodDescriptionVertexPartitionCollapser.collapseVertexPartitions
(VertexPartition<V, E> partitioning) Creates a new graph whose vertices correspond to the partitions of the supplied graph.static <V,
E> Graph <V, E> FoldingTransformer.foldHypergraphEdges
(Hypergraph<V, E> h, com.google.common.base.Supplier<Graph<V, E>> graph_factory, com.google.common.base.Supplier<E> edge_factory) Creates aGraph
which is an edge-folded version ofh
, where hyperedges are replaced by k-cliques in the output graph.static <V,
E> Graph <V, Collection<E>> FoldingTransformer.foldHypergraphEdges
(Hypergraph<V, E> h, com.google.common.base.Supplier<Graph<V, Collection<E>>> graph_factory) Creates aGraph
which is an edge-folded version ofh
, where hyperedges are replaced by k-cliques in the output graph.static <V,
E, F> Graph <E, F> FoldingTransformer.foldHypergraphVertices
(Hypergraph<V, E> h, com.google.common.base.Supplier<Graph<E, F>> graph_factory, com.google.common.base.Supplier<F> edge_factory) Creates aGraph
which is a vertex-folded version ofh
, whose vertices are the input's hyperedges and whose edges are induced by adjacent hyperedges in the input.Graph
<E, Collection<V>> FoldingTransformer.foldHypergraphVertices
(Hypergraph<V, E> h, com.google.common.base.Supplier<Graph<E, Collection<V>>> graph_factory) Creates aGraph
which is a vertex-folded version ofh
, whose vertices are the input's hyperedges and whose edges are induced by adjacent hyperedges in the input.static <V,
E> Graph <V, E> FoldingTransformer.foldKPartiteGraph
(KPartiteGraph<V, E> g, com.google.common.base.Predicate<V> p, com.google.common.base.Supplier<Graph<V, E>> graph_factory, com.google.common.base.Supplier<E> edge_factory) Convertsg
into a unipartite graph whose vertex set is the vertices ofg
's partitionp
.static <V,
E> Graph <V, Collection<V>> FoldingTransformer.foldKPartiteGraph
(KPartiteGraph<V, E> g, com.google.common.base.Predicate<V> p, com.google.common.base.Supplier<Graph<V, Collection<V>>> graph_factory) Convertsg
into a unipartite graph whose vertices are the vertices ofg
's partitionp
, and whose edges consist of collections of the intermediate vertices from other partitions.static <V,
E> Graph <V, E> DirectionTransformer.toDirected
(Graph<V, E> graph, com.google.common.base.Supplier<DirectedGraph<V, E>> graph_factory, com.google.common.base.Supplier<E> edge_factory, boolean create_new) Transformsgraph
(which may be of any directionality) into a directed graph.Methods in edu.uci.ics.jung.algorithms.transformation with parameters of type GraphModifier and TypeMethodDescriptionprivate static <S,
T> void FoldingTransformer.populateTarget
(Graph<S, Collection<T>> target, T e, ArrayList<S> incident) static <V,
E> Graph <V, E> DirectionTransformer.toDirected
(Graph<V, E> graph, com.google.common.base.Supplier<DirectedGraph<V, E>> graph_factory, com.google.common.base.Supplier<E> edge_factory, boolean create_new) Transformsgraph
(which may be of any directionality) into a directed graph.static <V,
E> UndirectedGraph <V, E> DirectionTransformer.toUndirected
(Graph<V, E> graph, com.google.common.base.Supplier<UndirectedGraph<V, E>> graph_factory, com.google.common.base.Supplier<E> edge_factory, boolean create_new) Transformsgraph
(which may be of any directionality) into an undirected graph.Method parameters in edu.uci.ics.jung.algorithms.transformation with type arguments of type GraphModifier and TypeMethodDescriptionstatic <V,
E> Graph <V, E> FoldingTransformer.foldHypergraphEdges
(Hypergraph<V, E> h, com.google.common.base.Supplier<Graph<V, E>> graph_factory, com.google.common.base.Supplier<E> edge_factory) Creates aGraph
which is an edge-folded version ofh
, where hyperedges are replaced by k-cliques in the output graph.static <V,
E> Graph <V, Collection<E>> FoldingTransformer.foldHypergraphEdges
(Hypergraph<V, E> h, com.google.common.base.Supplier<Graph<V, Collection<E>>> graph_factory) Creates aGraph
which is an edge-folded version ofh
, where hyperedges are replaced by k-cliques in the output graph.static <V,
E, F> Graph <E, F> FoldingTransformer.foldHypergraphVertices
(Hypergraph<V, E> h, com.google.common.base.Supplier<Graph<E, F>> graph_factory, com.google.common.base.Supplier<F> edge_factory) Creates aGraph
which is a vertex-folded version ofh
, whose vertices are the input's hyperedges and whose edges are induced by adjacent hyperedges in the input.Graph
<E, Collection<V>> FoldingTransformer.foldHypergraphVertices
(Hypergraph<V, E> h, com.google.common.base.Supplier<Graph<E, Collection<V>>> graph_factory) Creates aGraph
which is a vertex-folded version ofh
, whose vertices are the input's hyperedges and whose edges are induced by adjacent hyperedges in the input.static <V,
E> Graph <V, E> FoldingTransformer.foldKPartiteGraph
(KPartiteGraph<V, E> g, com.google.common.base.Predicate<V> p, com.google.common.base.Supplier<Graph<V, E>> graph_factory, com.google.common.base.Supplier<E> edge_factory) Convertsg
into a unipartite graph whose vertex set is the vertices ofg
's partitionp
.static <V,
E> Graph <V, Collection<V>> FoldingTransformer.foldKPartiteGraph
(KPartiteGraph<V, E> g, com.google.common.base.Predicate<V> p, com.google.common.base.Supplier<Graph<V, Collection<V>>> graph_factory) Convertsg
into a unipartite graph whose vertices are the vertices ofg
's partitionp
, and whose edges consist of collections of the intermediate vertices from other partitions.Constructor parameters in edu.uci.ics.jung.algorithms.transformation with type arguments of type Graph -
Uses of Graph in edu.uci.ics.jung.algorithms.util
Method parameters in edu.uci.ics.jung.algorithms.util with type arguments of type Graph -
Uses of Graph in edu.uci.ics.jung.graph
Subinterfaces of Graph in edu.uci.ics.jung.graphModifier and TypeInterfaceDescriptioninterface
DirectedGraph<V,
E> A tagging interface for implementations ofGraph
that accept only directed edges.interface
Forest<V,
E> An interface for a graph which consists of a collection of rooted directed acyclic graphs.interface
KPartiteGraph<V,
E> 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.interface
Tree<V,
E> A subtype ofGraph
which is a (directed, rooted) tree.interface
UndirectedGraph<V,
E> A tagging interface for extensions ofGraph
that accept only undirected edges.Classes in edu.uci.ics.jung.graph that implement GraphModifier and TypeClassDescriptionclass
AbstractGraph<V,
E> Abstract implementation of theGraph
interface.class
AbstractTypedGraph<V,
E> An abstract class for graphs whose edges all have the sameEdgeType
.class
DelegateForest<V,
E> An implementation ofForest
that delegates to a specifiedDirectedGraph
instance.class
DelegateTree<V,
E> An implementation ofTree
that delegates to a specified instance ofDirectedGraph
.class
An implementation ofDirectedGraph
, suitable for sparse graphs, that orders its vertex and edge collections according to insertion time.class
DirectedSparseGraph<V,
E> An implementation ofDirectedGraph
suitable for sparse graphs.class
An implementation ofDirectedGraph
, suitable for sparse graphs, that permits parallel edges.class
GraphDecorator<V,
E> An implementation ofGraph
that delegates its method calls to a constructor-specifiedGraph
instance.class
ObservableGraph<V,
E> A decorator class for graphs which generates eventsclass
OrderedKAryTree<V,
E> An implementation ofTree
in which each vertex has ≤ k children.class
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.class
An implementation ofGraph
that is suitable for sparse graphs, orders its vertex and edge collections according to either specifiedComparator
instances or the natural ordering of their elements, and permits directed, undirected, and parallel edges.class
SparseGraph<V,
E> An implementation ofGraph
that is suitable for sparse graphs and permits both directed and undirected edges.class
SparseMultigraph<V,
E> An implementation ofGraph
that is suitable for sparse graphs and permits directed, undirected, and parallel edges.class
An implementation ofUndirectedGraph
that is suitable for sparse graphs, orders its vertex and edge collections according to insertion time, and permits parallel edges.class
An implementation ofUndirectedGraph
that is suitable for sparse graphs.class
An implementation ofUndirectedGraph
that is suitable for sparse graphs and permits parallel edges.Fields in edu.uci.ics.jung.graph declared as GraphMethods in edu.uci.ics.jung.graph that return types with arguments of type GraphModifier and TypeMethodDescriptionstatic <V,
E> com.google.common.base.Supplier <Graph<V, E>> OrderedSparseMultigraph.getFactory()
static <V,
E> com.google.common.base.Supplier <Graph<V, E>> SortedSparseMultigraph.getFactory()
static <V,
E> com.google.common.base.Supplier <Graph<V, E>> SparseGraph.getFactory()
static <V,
E> com.google.common.base.Supplier <Graph<V, E>> SparseMultigraph.getFactory()
Constructors in edu.uci.ics.jung.graph with parameters of type GraphModifierConstructorDescriptionGraphDecorator
(Graph<V, E> delegate) Creates a new instance based on the provideddelegate
.ObservableGraph
(Graph<V, E> delegate) Creates a new instance based on the provideddelegate
. -
Uses of Graph in edu.uci.ics.jung.graph.event
Fields in edu.uci.ics.jung.graph.event declared as GraphMethods in edu.uci.ics.jung.graph.event that return GraphConstructors in edu.uci.ics.jung.graph.event with parameters of type GraphModifierConstructorDescriptionCreates a graph event for the specified graph, edge, and type.GraphEvent
(Graph<V, E> source, GraphEvent.Type type) Creates an instance with the specifiedsource
graph andType
(vertex/edge addition/removal).Creates a graph event for the specified graph, vertex, and type. -
Uses of Graph in edu.uci.ics.jung.graph.util
Classes in edu.uci.ics.jung.graph.util that implement GraphModifier and TypeClassDescription(package private) static class
(package private) static class
(package private) static class
(package private) static class
(package private) static class
(package private) static class
(package private) static class
(package private) static class
(package private) static class
(package private) static class
(package private) static class
(package private) static class
Fields in edu.uci.ics.jung.graph.util declared as GraphModifier and TypeFieldDescriptionGraphs.SynchronizedAbstractGraph.delegate
Graphs.UnmodifiableAbstractGraph.delegate
Fields in edu.uci.ics.jung.graph.util with type parameters of type GraphMethods in edu.uci.ics.jung.graph.util that return GraphModifier and TypeMethodDescriptionTestGraphs.createChainPlusIsolates
(int chain_length, int isolate_count) TestGraphs.createDirectedAcyclicGraph
(int layers, int maxNodesPerLayer, double linkprob) Creates a sample directed acyclic graph by generating several "layers", and connecting nodes (randomly) to nodes in earlier (but never later) layers.TestGraphs.createTestGraph
(boolean directed) Creates a small sample graph that can be used for testing purposes.TestGraphs.getDemoGraph()
Returns a bigger test graph with a clique, several components, and other parts.TestGraphs.getOneComponentGraph()
Returns a bigger, undirected test graph with a just one component.TestGraphs.getSmallGraph()
static <V,
E> Graph <V, E> Graphs.synchronizedGraph
(Graph<V, E> graph) Returns a synchronized graph backed by the passed argument graph.static <V,
E> Graph <V, E> Graphs.unmodifiableGraph
(Graph<V, E> graph) Returns an unmodifiable Graph backed by the passed Graph.Methods in edu.uci.ics.jung.graph.util with parameters of type GraphModifier and TypeMethodDescriptionprivate static void
int
Returns the index fore
ingraph
.protected int
protected int
int
Returnse
's index ingraph
.int
Returns the index for the specified edge.protected int
protected int
void
Resets the indices for this edge and its parallel edges.void
Resets the indices foredge
and its parallel edges ingraph
.void
Resets the indices for this edge and its parallel edges.static <V,
E> Graph <V, E> Graphs.synchronizedGraph
(Graph<V, E> graph) Returns a synchronized graph backed by the passed argument graph.static <V,
E> Graph <V, E> Graphs.unmodifiableGraph
(Graph<V, E> graph) Returns an unmodifiable Graph backed by the passed Graph.Constructors in edu.uci.ics.jung.graph.util with parameters of type GraphModifierConstructorDescriptionprivate
SynchronizedAbstractGraph
(Graph<V, E> delegate) private
SynchronizedGraph
(Graph<V, E> delegate) private
UnmodifiableAbstractGraph
(Graph<V, E> delegate) private
UnmodifiableGraph
(Graph<V, E> delegate) -
Uses of Graph in edu.uci.ics.jung.io
Classes in edu.uci.ics.jung.io with type parameters of type GraphModifier and TypeClassDescriptionclass
PajekNetReader<G extends Graph<V,
E>, V, E> Reads aGraph
from a Pajek NET formatted source.Methods in edu.uci.ics.jung.io that return GraphModifier and TypeMethodDescriptionLoads a graph from a file per the appropriate formatMethods in edu.uci.ics.jung.io with parameters of type GraphModifier and TypeMethodDescriptionprotected E
PajekNetReader.createAddEdge
(StringTokenizer st, V v1, EdgeType directed, Graph<V, E> g, List<V> id, com.google.common.base.Supplier<E> edge_factory) private String
PajekNetReader.readArcsOrEdges
(String curLine, BufferedReader br, Graph<V, E> g, List<V> id, com.google.common.base.Supplier<E> edge_factory) void
Save a graph to disk per the appropriate formatvoid
Saves the graph to the specified writer.void
PajekNetWriter.save
(Graph<V, E> g, Writer w, com.google.common.base.Function<V, String> vs, com.google.common.base.Function<E, Number> nev) Saves the graph to the specified writer.void
PajekNetWriter.save
(Graph<V, E> graph, Writer w, com.google.common.base.Function<V, String> vs, com.google.common.base.Function<E, Number> nev, com.google.common.base.Function<V, Point2D> vld) Saves the graph to the specified writer.void
Saves the graph to the specified file.void
PajekNetWriter.save
(Graph<V, E> g, String filename, com.google.common.base.Function<V, String> vs, com.google.common.base.Function<E, Number> nev) Saves the graph to the specified file.void
PajekNetWriter.save
(Graph<V, E> g, String filename, com.google.common.base.Function<V, String> vs, com.google.common.base.Function<E, Number> nev, com.google.common.base.Function<V, Point2D> vld) Saves the graph to the specified file. -
Uses of Graph in edu.uci.ics.jung.samples
Fields in edu.uci.ics.jung.samples declared as GraphModifier and TypeFieldDescription(package private) Graph
VertexCollapseDemoWithLayouts.collapsedGraph
AddNodeDemo.g
AnimatingAddNodeDemo.g
ShowLayouts.g_array
DrawnIconVertexDemo.graph
the graphEdgeLabelDemo.graph
the graphGraphEditorDemo.graph
the graphInternalFrameSatelliteViewDemo.graph
the graphLensDemo.graph
the graphMinimumSpanningTreeDemo.graph
the graphMultiViewDemo.graph
the graphPersistentLayoutDemo.graph
the graphPluggableRendererDemo.graph
PluggableRendererDemo.VertexShapeSizeAspect.graph
PluggableRendererDemo.VertexStrokeHighlight.graph
SubLayoutDemo.graph
the graphTwoModelDemo.graph
the graphUnicodeLabelDemo.graph
the graph(package private) Graph
VertexCollapseDemo.graph
the graph(package private) Graph
VertexCollapseDemoWithLayouts.graph
the graphVertexLabelAsShapeDemo.graph
VertexLabelPositionDemo.graph
the graphWorldMapGraphDemo.graph
the graphLensDemo.grid
a grid shaped graphShortestPathDemo.mGraph
Fields in edu.uci.ics.jung.samples with type parameters of type GraphModifier and TypeFieldDescriptionPluggableRendererDemo.self_loop
PluggableRendererDemo.GradientPickedEdgePaintFunction.selfLoop
SubLayoutDemo.sizes
Methods in edu.uci.ics.jung.samples that return GraphModifier and TypeMethodDescriptionPluggableRendererDemo.buildGraph()
Generates a mixed-mode random graph, runs VoltageRanker on it, and returns the resultant graph.LensDemo.generateVertexGrid
(Map<String, Point2D> vlf, Dimension d, int interval) ShortestPathDemo.GraphFactory.get()
ShortestPathDemo.getGraph()
static Graph
SimpleGraphDraw.getGraph()
Generates a graph: in this case, reads it from the file "samples/datasetsgraph/simple.net"Methods in edu.uci.ics.jung.samples with parameters of type GraphModifier and TypeMethodDescriptionSubLayoutDemo.getLayoutFor
(Class<CircleLayout> layoutClass, Graph<String, Number> graph) Method parameters in edu.uci.ics.jung.samples with type arguments of type GraphModifier and TypeMethodDescriptionboolean
boolean
Constructors in edu.uci.ics.jung.samples with parameters of type Graph -
Uses of Graph in edu.uci.ics.jung.visualization
Fields in edu.uci.ics.jung.visualization with type parameters of type GraphModifier and TypeFieldDescriptionPluggableRenderContext.edgeArrowPredicate
PluggableRenderContext.edgeArrowTransformer
PluggableRenderContext.edgeIncludePredicate
PluggableRenderContext.edgeLabelClosenessTransformer
PluggableRenderContext.vertexIncludePredicate
Methods in edu.uci.ics.jung.visualization that return types with arguments of type GraphModifier and TypeMethodDescriptionPluggableRenderContext.getEdgeArrowPredicate()
RenderContext.getEdgeArrowPredicate()
PluggableRenderContext.getEdgeArrowTransformer()
RenderContext.getEdgeArrowTransformer()
PluggableRenderContext.getEdgeIncludePredicate()
RenderContext.getEdgeIncludePredicate()
PluggableRenderContext.getEdgeLabelClosenessTransformer()
RenderContext.getEdgeLabelClosenessTransformer()
PluggableRenderContext.getVertexIncludePredicate()
RenderContext.getVertexIncludePredicate()
Method parameters in edu.uci.ics.jung.visualization with type arguments of type GraphModifier and TypeMethodDescriptionboolean
boolean
void
PluggableRenderContext.setEdgeArrowPredicate
(com.google.common.base.Predicate<Context<Graph<V, E>, E>> edgeArrowPredicate) void
RenderContext.setEdgeArrowPredicate
(com.google.common.base.Predicate<Context<Graph<V, E>, E>> edgeArrowPredicate) void
PluggableRenderContext.setEdgeArrowTransformer
(com.google.common.base.Function<? super Context<Graph<V, E>, E>, Shape> edgeArrowTransformer) void
RenderContext.setEdgeArrowTransformer
(com.google.common.base.Function<? super Context<Graph<V, E>, E>, Shape> edgeArrowTransformer) void
PluggableRenderContext.setEdgeIncludePredicate
(com.google.common.base.Predicate<Context<Graph<V, E>, E>> edgeIncludePredicate) void
RenderContext.setEdgeIncludePredicate
(com.google.common.base.Predicate<Context<Graph<V, E>, E>> edgeIncludePredicate) void
PluggableRenderContext.setEdgeLabelClosenessTransformer
(com.google.common.base.Function<? super Context<Graph<V, E>, E>, Number> edgeLabelClosenessTransformer) void
RenderContext.setEdgeLabelClosenessTransformer
(com.google.common.base.Function<? super Context<Graph<V, E>, E>, Number> edgeLabelClosenessTransformer) void
PluggableRenderContext.setVertexIncludePredicate
(com.google.common.base.Predicate<Context<Graph<V, E>, V>> vertexIncludePredicate) void
RenderContext.setVertexIncludePredicate
(com.google.common.base.Predicate<Context<Graph<V, E>, V>> vertexIncludePredicate) Constructors in edu.uci.ics.jung.visualization with parameters of type Graph -
Uses of Graph in edu.uci.ics.jung.visualization.decorators
Fields in edu.uci.ics.jung.visualization.decorators declared as GraphFields in edu.uci.ics.jung.visualization.decorators with type parameters of type GraphMethods in edu.uci.ics.jung.visualization.decorators with parameters of type GraphModifier and TypeMethodDescriptionEdgeShape.cubicCurve
(Graph<V, E> graph) static <V,
E> EdgeShape<V, E>.Orthogonal EdgeShape.orthogonal
(Graph<V, E> graph) Method parameters in edu.uci.ics.jung.visualization.decorators with type arguments of type GraphModifier and TypeMethodDescriptionConstructors in edu.uci.ics.jung.visualization.decorators with parameters of type Graph -
Uses of Graph in edu.uci.ics.jung.visualization.layout
Fields in edu.uci.ics.jung.visualization.layout declared as GraphModifier and TypeFieldDescriptionBoundingRectangleCollector.graph
BoundingRectanglePaintable.graph
LayoutEvent.graph
Methods in edu.uci.ics.jung.visualization.layout that return GraphMethods in edu.uci.ics.jung.visualization.layout with parameters of type GraphModifier and TypeMethodDescriptionvoid
void
void
Constructors in edu.uci.ics.jung.visualization.layout with parameters of type Graph -
Uses of Graph in edu.uci.ics.jung.visualization.picking
Method parameters in edu.uci.ics.jung.visualization.picking with type arguments of type GraphModifier and TypeMethodDescriptionprotected boolean
Returnstrue
if this edge and its endpoints in this graph are all included in the collections of elements to be rendered, andfalse
otherwise.protected boolean
Returnstrue
if this vertex in this graph is included in the collections of elements to be rendered, andfalse
otherwise. -
Uses of Graph in edu.uci.ics.jung.visualization.spatial
Classes in edu.uci.ics.jung.visualization.spatial that implement GraphModifier and TypeClassDescriptionclass
AggregateGraph<V,
E> class
FastRenderingGraph<V,
E> maintains caches of vertices and edges that will be the subset of the delegate graph's elements that are contained in some Rectangle.Fields in edu.uci.ics.jung.visualization.spatial declared as GraphMethods in edu.uci.ics.jung.visualization.spatial that return GraphMethods in edu.uci.ics.jung.visualization.spatial with parameters of type GraphConstructors in edu.uci.ics.jung.visualization.spatial with parameters of type GraphModifierConstructorDescriptionFastRenderingGraph
(Graph<V, E> graph, Set<Rectangle2D> bounds, BasicVisualizationServer<V, E> vv) -
Uses of Graph in edu.uci.ics.jung.visualization.subLayout
Fields in edu.uci.ics.jung.visualization.subLayout declared as GraphMethods in edu.uci.ics.jung.visualization.subLayout that return GraphModifier and TypeMethodDescription(package private) Graph
GraphCollapser.createGraph()
GraphCollapser.getClusterGraph
(Graph inGraph, Collection picked) Methods in edu.uci.ics.jung.visualization.subLayout with parameters of type GraphModifier and TypeMethodDescriptionprivate boolean
(package private) Object
GraphCollapser.findVertex
(Graph inGraph, Object vertex) GraphCollapser.getClusterGraph
(Graph inGraph, Collection picked) Constructors in edu.uci.ics.jung.visualization.subLayout with parameters of type Graph -
Uses of Graph in edu.uci.ics.jung.visualization.util
Methods in edu.uci.ics.jung.visualization.util with parameters of type GraphModifier and TypeMethodDescriptionint
Returns the index for the specified edge.protected int
protected int
void
Resets the indices for this edge and its parallel edges.