Uses of Interface
edu.uci.ics.jung.graph.Graph
-
Packages that use 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.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.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. -
-
Uses of Graph in edu.uci.ics.jung.algorithms.blockmodel
Fields in edu.uci.ics.jung.algorithms.blockmodel declared as Graph Modifier and Type Field Description private Graph<V,E>
VertexPartition. graph
Methods in edu.uci.ics.jung.algorithms.blockmodel that return Graph Modifier and Type Method Description Graph<V,E>
VertexPartition. getGraph()
Returns the graph on which the partition is defined.Methods in edu.uci.ics.jung.algorithms.blockmodel with parameters of type Graph Modifier and Type Method Description VertexPartition<V,E>
StructurallyEquivalent. apply(Graph<V,E> g)
protected java.util.Set<Pair<V>>
StructurallyEquivalent. 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 Graph Constructor Description VertexPartition(Graph<V,E> g, java.util.Collection<java.util.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.VertexPartition(Graph<V,E> g, java.util.Map<V,java.util.Set<V>> partition_map)
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.VertexPartition(Graph<V,E> g, java.util.Map<V,java.util.Set<V>> partition_map, java.util.Collection<java.util.Set<V>> vertex_sets)
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 Graph Modifier and Type Field Description protected Graph<V,E>
VoltageClusterer. g
Methods in edu.uci.ics.jung.algorithms.cluster with parameters of type Graph Modifier and Type Method Description java.util.Set<java.util.Set<V>>
EdgeBetweennessClusterer. apply(Graph<V,E> graph)
Finds the set of clusters which have the strongest "community structure".java.util.Set<java.util.Set<V>>
WeakComponentClusterer. apply(Graph<V,E> graph)
Extracts the weak components from a graph.Constructors in edu.uci.ics.jung.algorithms.cluster with parameters of type Graph Constructor Description VoltageClusterer(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 Graph Modifier and Type Method Description Graph<V,E>
EdgePredicateFilter. apply(Graph<V,E> g)
Graph<V,E>
KNeighborhoodFilter. apply(Graph<V,E> graph)
Constructs an unassembled graph containing the k-neighborhood around the root node(s).Graph<V,E>
VertexPredicateFilter. apply(Graph<V,E> g)
Methods in edu.uci.ics.jung.algorithms.filters with parameters of type Graph Modifier and Type Method Description Graph<V,E>
EdgePredicateFilter. apply(Graph<V,E> g)
Graph<V,E>
KNeighborhoodFilter. apply(Graph<V,E> graph)
Constructs an unassembled graph containing the k-neighborhood around the root node(s).Graph<V,E>
VertexPredicateFilter. apply(Graph<V,E> g)
-
Uses of Graph in edu.uci.ics.jung.algorithms.generators
Fields in edu.uci.ics.jung.algorithms.generators with type parameters of type Graph Modifier and Type Field Description protected com.google.common.base.Supplier<? extends Graph<V,E>>
Lattice2DGenerator. graph_factory
Methods in edu.uci.ics.jung.algorithms.generators that return Graph Modifier and Type Method Description Graph<V,E>
Lattice2DGenerator. get()
Generates a graph based on the constructor-specified settings.Constructor parameters in edu.uci.ics.jung.algorithms.generators with type arguments of type Graph Constructor Description 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 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 Graph Modifier and Type Field Description private Graph<V,E>
BarabasiAlbertGenerator. mGraph
Fields in edu.uci.ics.jung.algorithms.generators.random with type parameters of type Graph Modifier and Type Field Description protected com.google.common.base.Supplier<Graph<V,E>>
BarabasiAlbertGenerator. graphFactory
private com.google.common.base.Supplier<Graph<V,E>>
EppsteinPowerLawGenerator. graphFactory
Methods in edu.uci.ics.jung.algorithms.generators.random that return Graph Modifier and Type Method Description static <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, java.util.Map<E,java.lang.Number> edge_weights, int num_vertices, java.util.Set<V> seedVertices)
Returns a random mixed-mode graph.Graph<V,E>
BarabasiAlbertGenerator. get()
Graph<V,E>
EppsteinPowerLawGenerator. get()
Generates a graph whose degree distribution approximates a power-law.Graph<V,E>
ErdosRenyiGenerator. get()
Returns a graph in which each pair of vertices is connected by an undirected edge with the probability specified by the constructor.Graph<V,E>
KleinbergSmallWorldGenerator. get()
Generates a random small world network according to the parameters givenprotected Graph<V,E>
EppsteinPowerLawGenerator. initializeGraph()
Method parameters in edu.uci.ics.jung.algorithms.generators.random with type arguments of type Graph Modifier and Type Method Description static <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, java.util.Map<E,java.lang.Number> edge_weights, int num_vertices, java.util.Set<V> seedVertices)
Returns a random mixed-mode graph.Constructor parameters in edu.uci.ics.jung.algorithms.generators.random with type arguments of type Graph Constructor Description 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, int seed, java.util.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, java.util.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 Graph Modifier and Type Field Description private Graph<V,E>
AbstractRanker. mGraph
Methods in edu.uci.ics.jung.algorithms.importance that return Graph Modifier and Type Method Description protected Graph<V,E>
AbstractRanker. getGraph()
Methods in edu.uci.ics.jung.algorithms.importance with parameters of type Graph Modifier and Type Method Description protected 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, java.util.Map<V,BetweennessCentrality.BetweennessData> decorator)
Constructors in edu.uci.ics.jung.algorithms.importance with parameters of type Graph Constructor Description BetweennessCentrality(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 Graph Modifier and Type Field Description protected Graph<V,E>
AbstractLayout. graph
Methods in edu.uci.ics.jung.algorithms.layout that return Graph Modifier and Type Method Description Graph<V,E>
AbstractLayout. getGraph()
Graph<V,E>
AggregateLayout. getGraph()
Graph<V,E>
Layout. getGraph()
Graph<V,E>
LayoutDecorator. getGraph()
Graph<V,E>
TreeLayout. getGraph()
Methods in edu.uci.ics.jung.algorithms.layout with parameters of type Graph Modifier and Type Method Description void
AbstractLayout. setGraph(Graph<V,E> graph)
void
AggregateLayout. setGraph(Graph<V,E> graph)
void
Layout. setGraph(Graph<V,E> graph)
void
LayoutDecorator. setGraph(Graph<V,E> graph)
void
TreeLayout. setGraph(Graph<V,E> graph)
Constructors in edu.uci.ics.jung.algorithms.layout with parameters of type Graph Constructor Description AbstractLayout(Graph<V,E> graph)
Creates an instance forgraph
which does not initialize the vertex locations.AbstractLayout(Graph<V,E> graph, com.google.common.base.Function<V,java.awt.geom.Point2D> initializer)
Creates an instance forgraph
which initializes the vertex locations usinginitializer
.AbstractLayout(Graph<V,E> graph, com.google.common.base.Function<V,java.awt.geom.Point2D> initializer, java.awt.Dimension size)
Creates an instance forgraph
which initializes the vertex locations usinginitializer
and sets the size of the layout tosize
.AbstractLayout(Graph<V,E> graph, java.awt.Dimension size)
Creates an instance forgraph
which sets the size of the layout tosize
.CircleLayout(Graph<V,E> g)
DAGLayout(Graph<V,E> g)
FRLayout(Graph<V,E> g)
FRLayout(Graph<V,E> g, java.awt.Dimension d)
FRLayout2(Graph<V,E> g)
FRLayout2(Graph<V,E> g, java.awt.Dimension d)
ISOMLayout(Graph<V,E> g)
KKLayout(Graph<V,E> g)
KKLayout(Graph<V,E> g, Distance<V> distance)
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.SpringLayout(Graph<V,E> g, com.google.common.base.Function<? super E,java.lang.Integer> length_function)
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.SpringLayout2(Graph<V,E> g, com.google.common.base.Function<E,java.lang.Integer> length_function)
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,java.awt.geom.Point2D> initializer)
StaticLayout(Graph<V,E> graph, com.google.common.base.Function<V,java.awt.geom.Point2D> initializer, java.awt.Dimension size)
StaticLayout(Graph<V,E> graph, java.awt.Dimension size)
-
Uses of Graph in edu.uci.ics.jung.algorithms.metrics
Fields in edu.uci.ics.jung.algorithms.metrics declared as Graph Modifier and Type Field Description protected Graph<V,E>
StructuralHoles. g
Methods in edu.uci.ics.jung.algorithms.metrics with parameters of type Graph Modifier and Type Method Description static <V,E>
java.util.Map<V,java.lang.Double>Metrics. clusteringCoefficients(Graph<V,E> graph)
Returns aMap
of vertices to their clustering coefficients.protected static <V,E>
booleanTriadicCensus. link(Graph<V,E> g, V a, V b)
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>
booleanTriadicCensus. shouldCount(Graph<V,E> g, java.util.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>
intTriadicCensus. triCode(Graph<V,E> g, V u, V v, V w)
This is the core of the technique in the paper.Constructors in edu.uci.ics.jung.algorithms.metrics with parameters of type Graph Constructor Description StructuralHoles(Graph<V,E> graph, com.google.common.base.Function<E,? extends java.lang.Number> nev)
-
Uses of Graph in edu.uci.ics.jung.algorithms.scoring
Fields in edu.uci.ics.jung.algorithms.scoring declared as Graph Modifier and Type Field Description protected Graph<V,E>
BetweennessCentrality. graph
Methods in edu.uci.ics.jung.algorithms.scoring with parameters of type Graph Modifier and Type Method Description protected void
BetweennessCentrality. initialize(Graph<V,E> graph)
Constructors in edu.uci.ics.jung.algorithms.scoring with parameters of type Graph Constructor Description BetweennessCentrality(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 java.lang.Number> edge_weights)
Calculates betweenness scores based on the all-pairs weighted shortest paths in the graph.HITS(Graph<V,E> g)
Creates an instance for the specified graph.HITS(Graph<V,E> g, double alpha)
Creates an instance for the specified graph and alpha (random jump probability) parameter.HITS(Graph<V,E> g, com.google.common.base.Function<E,java.lang.Double> edge_weights, double alpha)
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 Graph Modifier and Type Field Description protected Graph<V,E>
UniformInOut. graph
The graph for which the edge weights are defined.Constructors in edu.uci.ics.jung.algorithms.scoring.util with parameters of type Graph Constructor Description UniformInOut(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 Graph Modifier and Type Field Description protected Graph<V,E>
MinimumSpanningForest. graph
protected Graph<V,E>
MinimumSpanningForest2. graph
Fields in edu.uci.ics.jung.algorithms.shortestpath with type parameters of type Graph Modifier and Type Field Description protected com.google.common.base.Supplier<? extends Graph<V,E>>
PrimMinimumSpanningTree. treeFactory
Methods in edu.uci.ics.jung.algorithms.shortestpath that return Graph Modifier and Type Method Description Graph<V,E>
PrimMinimumSpanningTree. apply(Graph<V,E> graph)
Methods in edu.uci.ics.jung.algorithms.shortestpath with parameters of type Graph Modifier and Type Method Description Graph<V,E>
PrimMinimumSpanningTree. apply(Graph<V,E> graph)
protected V
PrimMinimumSpanningTree. findRoot(Graph<V,E> graph)
static <V,E>
java.util.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, java.util.Collection<E> unfinishedEdges)
Constructors in edu.uci.ics.jung.algorithms.shortestpath with parameters of type Graph Constructor Description DijkstraDistance(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.DijkstraShortestPath(Graph<V,E> g, com.google.common.base.Function<E,? extends java.lang.Number> nev)
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 java.lang.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, java.util.Map<E,java.lang.Double> weights)
Creates a Forest from the supplied Graph and supplied Supplier, which is used to create a new, empty Forest.MinimumSpanningForest(Graph<V,E> graph, Forest<V,E> forest, V root)
Creates a minimum spanning forest from the supplied graph, populating the supplied Forest, which must be empty.MinimumSpanningForest(Graph<V,E> graph, Forest<V,E> forest, V root, java.util.Map<E,java.lang.Double> weights)
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,java.lang.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,java.lang.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 Graph Constructor Description 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,java.lang.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,java.lang.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 Graph Modifier and Type Field Description protected com.google.common.base.Supplier<Graph<CV,CE>>
VertexPartitionCollapser. graph_factory
Methods in edu.uci.ics.jung.algorithms.transformation that return Graph Modifier and Type Method Description Graph<CV,CE>
VertexPartitionCollapser. 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,java.util.Collection<E>>FoldingTransformer. foldHypergraphEdges(Hypergraph<V,E> h, com.google.common.base.Supplier<Graph<V,java.util.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,java.util.Collection<V>>
FoldingTransformer. foldHypergraphVertices(Hypergraph<V,E> h, com.google.common.base.Supplier<Graph<E,java.util.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,java.util.Collection<V>>FoldingTransformer. foldKPartiteGraph(KPartiteGraph<V,E> g, com.google.common.base.Predicate<V> p, com.google.common.base.Supplier<Graph<V,java.util.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 Graph Modifier and Type Method Description private static <S,T>
voidFoldingTransformer. populateTarget(Graph<S,java.util.Collection<T>> target, T e, java.util.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 Graph Modifier and Type Method Description 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,java.util.Collection<E>>FoldingTransformer. foldHypergraphEdges(Hypergraph<V,E> h, com.google.common.base.Supplier<Graph<V,java.util.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,java.util.Collection<V>>
FoldingTransformer. foldHypergraphVertices(Hypergraph<V,E> h, com.google.common.base.Supplier<Graph<E,java.util.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,java.util.Collection<V>>FoldingTransformer. foldKPartiteGraph(KPartiteGraph<V,E> g, com.google.common.base.Predicate<V> p, com.google.common.base.Supplier<Graph<V,java.util.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 Constructor Description VertexPartitionCollapser(com.google.common.base.Supplier<Graph<CV,CE>> graph_factory, com.google.common.base.Supplier<CV> vertex_factory, com.google.common.base.Supplier<CE> edge_factory)
Creates an instance with the specified graph and element factories. -
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 Modifier and Type Method Description boolean
SelfLoopEdgePredicate. apply(Context<Graph<V,E>,E> context)
-
Uses of Graph in edu.uci.ics.jung.graph
Subinterfaces of Graph in edu.uci.ics.jung.graph Modifier and Type Interface Description interface
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 Graph Modifier and Type Class Description class
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
DirectedOrderedSparseMultigraph<V,E>
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
DirectedSparseMultigraph<V,E>
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
OrderedSparseMultigraph<V,E>
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
SortedSparseMultigraph<V,E>
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
UndirectedOrderedSparseMultigraph<V,E>
An implementation ofUndirectedGraph
that is suitable for sparse graphs, orders its vertex and edge collections according to insertion time, and permits parallel edges.class
UndirectedSparseGraph<V,E>
An implementation ofUndirectedGraph
that is suitable for sparse graphs.class
UndirectedSparseMultigraph<V,E>
An implementation ofUndirectedGraph
that is suitable for sparse graphs and permits parallel edges.Fields in edu.uci.ics.jung.graph declared as Graph Modifier and Type Field Description protected Graph<V,E>
GraphDecorator. delegate
Methods in edu.uci.ics.jung.graph that return types with arguments of type Graph Modifier and Type Method Description static <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 Graph Constructor Description GraphDecorator(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 Graph Modifier and Type Field Description protected Graph<V,E>
GraphEvent. source
Methods in edu.uci.ics.jung.graph.event that return Graph Modifier and Type Method Description Graph<V,E>
GraphEvent. getSource()
Constructors in edu.uci.ics.jung.graph.event with parameters of type Graph Constructor Description Edge(Graph<V,E> source, GraphEvent.Type type, E edge)
Creates 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).Vertex(Graph<V,E> source, GraphEvent.Type type, V vertex)
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 Graph Modifier and Type Class Description (package private) static class
Graphs.SynchronizedAbstractGraph<V,E>
(package private) static class
Graphs.SynchronizedDirectedGraph<V,E>
(package private) static class
Graphs.SynchronizedForest<V,E>
(package private) static class
Graphs.SynchronizedGraph<V,E>
(package private) static class
Graphs.SynchronizedTree<V,E>
(package private) static class
Graphs.SynchronizedUndirectedGraph<V,E>
(package private) static class
Graphs.UnmodifiableAbstractGraph<V,E>
(package private) static class
Graphs.UnmodifiableDirectedGraph<V,E>
(package private) static class
Graphs.UnmodifiableForest<V,E>
(package private) static class
Graphs.UnmodifiableGraph<V,E>
(package private) static class
Graphs.UnmodifiableTree<V,E>
(package private) static class
Graphs.UnmodifiableUndirectedGraph<V,E>
Fields in edu.uci.ics.jung.graph.util declared as Graph Modifier and Type Field Description protected Graph<V,E>
Graphs.SynchronizedAbstractGraph. delegate
protected Graph<V,E>
Graphs.UnmodifiableAbstractGraph. delegate
Fields in edu.uci.ics.jung.graph.util with type parameters of type Graph Modifier and Type Field Description protected java.util.Map<Context<Graph<V,E>,E>,java.lang.Integer>
DefaultParallelEdgeIndexFunction. edge_index
Methods in edu.uci.ics.jung.graph.util that return Graph Modifier and Type Method Description static Graph<java.lang.String,java.lang.Number>
TestGraphs. createChainPlusIsolates(int chain_length, int isolate_count)
static Graph<java.lang.String,java.lang.Number>
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.static Graph<java.lang.String,java.lang.Number>
TestGraphs. createTestGraph(boolean directed)
Creates a small sample graph that can be used for testing purposes.static Graph<java.lang.String,java.lang.Number>
TestGraphs. getDemoGraph()
Returns a bigger test graph with a clique, several components, and other parts.static Graph<java.lang.String,java.lang.Number>
TestGraphs. getOneComponentGraph()
Returns a bigger, undirected test graph with a just one component.static Graph<java.lang.String,java.lang.Number>
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 Graph Modifier and Type Method Description private static void
TestGraphs. createEdge(Graph<java.lang.String,java.lang.Number> g, java.lang.String v1Label, java.lang.String v2Label, int weight)
int
DefaultParallelEdgeIndexFunction. getIndex(Graph<V,E> graph, E e)
Returns the index fore
ingraph
.protected int
DefaultParallelEdgeIndexFunction. getIndex(Graph<V,E> graph, E e, V v)
protected int
DefaultParallelEdgeIndexFunction. getIndex(Graph<V,E> graph, E e, V v, V u)
int
EdgeIndexFunction. getIndex(Graph<V,E> graph, E e)
Returnse
's index ingraph
.int
IncidentEdgeIndexFunction. getIndex(Graph<V,E> graph, E e)
Returns the index for the specified edge.protected int
IncidentEdgeIndexFunction. getIndex(Graph<V,E> graph, E e, V v)
protected int
IncidentEdgeIndexFunction. getIndex(Graph<V,E> graph, E e, V u, V v)
void
DefaultParallelEdgeIndexFunction. reset(Graph<V,E> graph, E e)
Resets the indices for this edge and its parallel edges.void
EdgeIndexFunction. reset(Graph<V,E> g, E edge)
Resets the indices foredge
and its parallel edges ingraph
.void
IncidentEdgeIndexFunction. reset(Graph<V,E> graph, E e)
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 Graph Constructor Description SynchronizedAbstractGraph(Graph<V,E> delegate)
SynchronizedGraph(Graph<V,E> delegate)
UnmodifiableAbstractGraph(Graph<V,E> delegate)
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 Graph Modifier and Type Class Description class
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 Graph Modifier and Type Method Description Graph<V,E>
GraphFile. load(java.lang.String filename)
Loads a graph from a file per the appropriate formatMethods in edu.uci.ics.jung.io with parameters of type Graph Modifier and Type Method Description protected E
PajekNetReader. createAddEdge(java.util.StringTokenizer st, V v1, EdgeType directed, Graph<V,E> g, java.util.List<V> id, com.google.common.base.Supplier<E> edge_factory)
private java.lang.String
PajekNetReader. readArcsOrEdges(java.lang.String curLine, java.io.BufferedReader br, Graph<V,E> g, java.util.List<V> id, com.google.common.base.Supplier<E> edge_factory)
void
GraphFile. save(Graph<V,E> graph, java.lang.String filename)
Save a graph to disk per the appropriate formatvoid
PajekNetWriter. save(Graph<V,E> g, java.io.Writer w)
Saves the graph to the specified writer.void
PajekNetWriter. save(Graph<V,E> g, java.io.Writer w, com.google.common.base.Function<V,java.lang.String> vs, com.google.common.base.Function<E,java.lang.Number> nev)
Saves the graph to the specified writer.void
PajekNetWriter. save(Graph<V,E> graph, java.io.Writer w, com.google.common.base.Function<V,java.lang.String> vs, com.google.common.base.Function<E,java.lang.Number> nev, com.google.common.base.Function<V,java.awt.geom.Point2D> vld)
Saves the graph to the specified writer.void
PajekNetWriter. save(Graph<V,E> g, java.lang.String filename)
Saves the graph to the specified file.void
PajekNetWriter. save(Graph<V,E> g, java.lang.String filename, com.google.common.base.Function<V,java.lang.String> vs, com.google.common.base.Function<E,java.lang.Number> nev)
Saves the graph to the specified file.void
PajekNetWriter. save(Graph<V,E> g, java.lang.String filename, com.google.common.base.Function<V,java.lang.String> vs, com.google.common.base.Function<E,java.lang.Number> nev, com.google.common.base.Function<V,java.awt.geom.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 Graph Modifier and Type Field Description (package private) Graph
VertexCollapseDemoWithLayouts. collapsedGraph
private Graph<java.lang.Number,java.lang.Number>
AddNodeDemo. g
private Graph<java.lang.Number,java.lang.Number>
AnimatingAddNodeDemo. g
protected static Graph<? extends java.lang.Object,? extends java.lang.Object>[]
ShowLayouts. g_array
(package private) Graph<java.lang.Integer,java.lang.Number>
DrawnIconVertexDemo. graph
the graph(package private) Graph<java.lang.Integer,java.lang.Number>
EdgeLabelDemo. graph
the graph(package private) Graph<java.lang.Number,java.lang.Number>
GraphEditorDemo. graph
the graph(package private) Graph<java.lang.String,java.lang.Number>
InternalFrameSatelliteViewDemo. graph
the graph(package private) Graph<java.lang.String,java.lang.Number>
LensDemo. graph
the graph(package private) Graph<java.lang.String,java.lang.Number>
MinimumSpanningTreeDemo. graph
the graph(package private) Graph<java.lang.String,java.lang.Number>
MultiViewDemo. graph
the graph(package private) Graph<java.lang.String,java.lang.Number>
PersistentLayoutDemo. graph
the graphprivate Graph<java.lang.Integer,java.lang.Number>
PluggableRendererDemo. graph
protected Graph<V,E>
PluggableRendererDemo.VertexShapeSizeAspect. graph
protected Graph<V,E>
PluggableRendererDemo.VertexStrokeHighlight. graph
(package private) Graph<java.lang.String,java.lang.Number>
SubLayoutDemo. graph
the graph(package private) Graph<java.lang.String,java.lang.Number>
TwoModelDemo. graph
the graph(package private) Graph<java.lang.Integer,java.lang.Number>
UnicodeLabelDemo. graph
the graph(package private) Graph
VertexCollapseDemo. graph
the graph(package private) Graph
VertexCollapseDemoWithLayouts. graph
the graph(package private) Graph<java.lang.String,java.lang.Number>
VertexLabelAsShapeDemo. graph
(package private) Graph<java.lang.String,java.lang.Number>
VertexLabelPositionDemo. graph
the graph(package private) Graph<java.lang.String,java.lang.Number>
WorldMapGraphDemo. graph
the graph(package private) Graph<java.lang.String,java.lang.Number>
LensDemo. grid
a grid shaped graphprivate Graph<java.lang.String,java.lang.Number>
ShortestPathDemo. mGraph
Fields in edu.uci.ics.jung.samples with type parameters of type Graph Modifier and Type Field Description protected com.google.common.base.Predicate<Context<Graph<java.lang.Integer,java.lang.Number>,java.lang.Number>>
PluggableRendererDemo. self_loop
(package private) com.google.common.base.Predicate<Context<Graph<V,E>,E>>
PluggableRendererDemo.GradientPickedEdgePaintFunction. selfLoop
(package private) java.util.Map<Graph<java.lang.String,java.lang.Number>,java.awt.Dimension>
SubLayoutDemo. sizes
Methods in edu.uci.ics.jung.samples that return Graph Modifier and Type Method Description Graph<java.lang.Integer,java.lang.Number>
PluggableRendererDemo. buildGraph()
Generates a mixed-mode random graph, runs VoltageRanker on it, and returns the resultant graph.private Graph<java.lang.String,java.lang.Number>
LensDemo. generateVertexGrid(java.util.Map<java.lang.String,java.awt.geom.Point2D> vlf, java.awt.Dimension d, int interval)
Graph<java.lang.String,java.lang.Number>
ShortestPathDemo.GraphFactory. get()
(package private) Graph<java.lang.String,java.lang.Number>
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 Graph Modifier and Type Method Description private Layout<java.lang.String,java.lang.Number>
SubLayoutDemo. getLayoutFor(java.lang.Class<CircleLayout> layoutClass, Graph<java.lang.String,java.lang.Number> graph)
Method parameters in edu.uci.ics.jung.samples with type arguments of type Graph Modifier and Type Method Description boolean
PluggableRendererDemo.DirectionDisplayPredicate. apply(Context<Graph<V,E>,E> context)
boolean
PluggableRendererDemo.VertexDisplayPredicate. apply(Context<Graph<V,E>,V> context)
Constructors in edu.uci.ics.jung.samples with parameters of type Graph Constructor Description VertexShapeSizeAspect(Graph<V,E> graphIn, com.google.common.base.Function<V,java.lang.Double> voltagesIn)
VertexStrokeHighlight(Graph<V,E> graph, PickedInfo<V> pi)
-
Uses of Graph in edu.uci.ics.jung.visualization
Fields in edu.uci.ics.jung.visualization with type parameters of type Graph Modifier and Type Field Description protected com.google.common.base.Predicate<Context<Graph<V,E>,E>>
PluggableRenderContext. edgeArrowPredicate
protected com.google.common.base.Function<? super Context<Graph<V,E>,E>,java.awt.Shape>
PluggableRenderContext. edgeArrowTransformer
protected com.google.common.base.Predicate<Context<Graph<V,E>,E>>
PluggableRenderContext. edgeIncludePredicate
protected com.google.common.base.Function<? super Context<Graph<V,E>,E>,java.lang.Number>
PluggableRenderContext. edgeLabelClosenessTransformer
protected com.google.common.base.Predicate<Context<Graph<V,E>,V>>
PluggableRenderContext. vertexIncludePredicate
Methods in edu.uci.ics.jung.visualization that return types with arguments of type Graph Modifier and Type Method Description com.google.common.base.Predicate<Context<Graph<V,E>,E>>
PluggableRenderContext. getEdgeArrowPredicate()
com.google.common.base.Predicate<Context<Graph<V,E>,E>>
RenderContext. getEdgeArrowPredicate()
com.google.common.base.Function<? super Context<Graph<V,E>,E>,java.awt.Shape>
PluggableRenderContext. getEdgeArrowTransformer()
com.google.common.base.Function<? super Context<Graph<V,E>,E>,java.awt.Shape>
RenderContext. getEdgeArrowTransformer()
com.google.common.base.Predicate<Context<Graph<V,E>,E>>
PluggableRenderContext. getEdgeIncludePredicate()
com.google.common.base.Predicate<Context<Graph<V,E>,E>>
RenderContext. getEdgeIncludePredicate()
com.google.common.base.Function<? super Context<Graph<V,E>,E>,java.lang.Number>
PluggableRenderContext. getEdgeLabelClosenessTransformer()
com.google.common.base.Function<? super Context<Graph<V,E>,E>,java.lang.Number>
RenderContext. getEdgeLabelClosenessTransformer()
com.google.common.base.Predicate<Context<Graph<V,E>,V>>
PluggableRenderContext. getVertexIncludePredicate()
com.google.common.base.Predicate<Context<Graph<V,E>,V>>
RenderContext. getVertexIncludePredicate()
Method parameters in edu.uci.ics.jung.visualization with type arguments of type Graph Modifier and Type Method Description boolean
RenderContext.DirectedEdgeArrowPredicate. apply(Context<Graph<V,E>,E> c)
boolean
RenderContext.UndirectedEdgeArrowPredicate. apply(Context<Graph<V,E>,E> c)
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>,java.awt.Shape> edgeArrowTransformer)
void
RenderContext. setEdgeArrowTransformer(com.google.common.base.Function<? super Context<Graph<V,E>,E>,java.awt.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>,java.lang.Number> edgeLabelClosenessTransformer)
void
RenderContext. setEdgeLabelClosenessTransformer(com.google.common.base.Function<? super Context<Graph<V,E>,E>,java.lang.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 Constructor Description PluggableRenderContext(Graph<V,E> graph)
-
Uses of Graph in edu.uci.ics.jung.visualization.decorators
Fields in edu.uci.ics.jung.visualization.decorators declared as Graph Modifier and Type Field Description protected Graph<V,E>
EdgeShape. graph
Fields in edu.uci.ics.jung.visualization.decorators with type parameters of type Graph Modifier and Type Field Description protected com.google.common.base.Predicate<Context<Graph<V,E>,E>>
GradientEdgePaintTransformer. selfLoop
Methods in edu.uci.ics.jung.visualization.decorators with parameters of type Graph Modifier and Type Method Description static <V,E>
EdgeShape.QuadCurveEdgeShape. cubicCurve(Graph<V,E> graph)
static <V,E>
EdgeShape.LineEdgeShape. line(Graph<V,E> graph)
static <V,E>
EdgeShape.OrthogonalEdgeShape. orthogonal(Graph<V,E> graph)
static <V,E>
EdgeShape.QuadCurveEdgeShape. quadCurve(Graph<V,E> graph)
static <V,E>
EdgeShape.WedgeEdgeShape. wedge(Graph<V,E> graph, int width)
Method parameters in edu.uci.ics.jung.visualization.decorators with type arguments of type Graph Modifier and Type Method Description java.lang.Number
ConstantDirectionalEdgeValueTransformer. apply(Context<Graph<V,E>,E> context)
java.awt.Shape
DirectionalEdgeArrowTransformer. apply(Context<Graph<V,E>,E> context)
Constructors in edu.uci.ics.jung.visualization.decorators with parameters of type Graph Constructor Description EdgeShape(Graph<V,E> g)
-
Uses of Graph in edu.uci.ics.jung.visualization.layout
Fields in edu.uci.ics.jung.visualization.layout declared as Graph Modifier and Type Field Description protected Graph<V,E>
BoundingRectangleCollector. graph
protected Graph<V,E>
BoundingRectanglePaintable. graph
(package private) Graph<V,E>
LayoutEvent. graph
Methods in edu.uci.ics.jung.visualization.layout that return Graph Modifier and Type Method Description Graph<V,E>
LayoutEvent. getGraph()
Methods in edu.uci.ics.jung.visualization.layout with parameters of type Graph Modifier and Type Method Description void
CachingLayout. setGraph(Graph<V,E> graph)
void
LayoutEvent. setGraph(Graph<V,E> graph)
void
ObservableCachingLayout. setGraph(Graph<V,E> graph)
Constructors in edu.uci.ics.jung.visualization.layout with parameters of type Graph Constructor Description LayoutEvent(V vertex, Graph<V,E> 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 Graph Modifier and Type Method Description protected boolean
ShapePickSupport. isEdgeRendered(Context<Graph<V,E>,E> context)
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
ShapePickSupport. isVertexRendered(Context<Graph<V,E>,V> context)
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 Graph Modifier and Type Class Description class
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 Graph Modifier and Type Field Description protected Graph<V,E>
FastRenderingGraph. graph
protected Graph<V,E>
FastRenderingLayout. graph
Methods in edu.uci.ics.jung.visualization.spatial that return Graph Modifier and Type Method Description Graph<V,E>
FastRenderingLayout. getGraph()
Methods in edu.uci.ics.jung.visualization.spatial with parameters of type Graph Modifier and Type Method Description void
FastRenderingLayout. setGraph(Graph<V,E> graph)
Constructors in edu.uci.ics.jung.visualization.spatial with parameters of type Graph Constructor Description FastRenderingGraph(Graph<V,E> graph, java.util.Set<java.awt.geom.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 Graph Modifier and Type Field Description private Graph
GraphCollapser. originalGraph
Methods in edu.uci.ics.jung.visualization.subLayout that return Graph Modifier and Type Method Description Graph
GraphCollapser. collapse(Graph inGraph, Graph clusterGraph)
(package private) Graph
GraphCollapser. createGraph()
Graph
GraphCollapser. expand(Graph inGraph, Graph clusterGraph)
Graph
GraphCollapser. getClusterGraph(Graph inGraph, java.util.Collection picked)
Methods in edu.uci.ics.jung.visualization.subLayout with parameters of type Graph Modifier and Type Method Description Graph
GraphCollapser. collapse(Graph inGraph, Graph clusterGraph)
private boolean
GraphCollapser. contains(Graph inGraph, java.lang.Object vertex)
Graph
GraphCollapser. expand(Graph inGraph, Graph clusterGraph)
(package private) java.lang.Object
GraphCollapser. findVertex(Graph inGraph, java.lang.Object vertex)
Graph
GraphCollapser. getClusterGraph(Graph inGraph, java.util.Collection picked)
Constructors in edu.uci.ics.jung.visualization.subLayout with parameters of type Graph Constructor Description GraphCollapser(Graph originalGraph)
-
Uses of Graph in edu.uci.ics.jung.visualization.util
Methods in edu.uci.ics.jung.visualization.util with parameters of type Graph Modifier and Type Method Description int
PredicatedParallelEdgeIndexFunction. getIndex(Graph<V,E> graph, E e)
Returns the index for the specified edge.protected int
PredicatedParallelEdgeIndexFunction. getIndex(Graph<V,E> graph, E e, V v)
protected int
PredicatedParallelEdgeIndexFunction. getIndex(Graph<V,E> graph, E e, V v, V u)
void
PredicatedParallelEdgeIndexFunction. reset(Graph<V,E> graph, E e)
Resets the indices for this edge and its parallel edges.
-