Index (JUNG - Algorithms 2.1.1 API)

A B C D E F G H I K L M N O P R S T U V W

A

AbstractIterativeScorer<V,E,T> - Class in edu.uci.ics.jung.algorithms.scoring: An abstract class for algorithms that assign scores to vertices based on iterative methods.
AbstractIterativeScorer(Hypergraph<V, E>, Function<? super E, ? extends Number>) - Constructor for class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer: Creates an instance for the specified graph and edge weights.
AbstractIterativeScorer(Hypergraph<V, E>) - Constructor for class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer: Creates an instance for the specified graph g.
AbstractIterativeScorerWithPriors<V,E,S> - Class in edu.uci.ics.jung.algorithms.scoring: An abstract class for iterative random-walk-based vertex scoring algorithms that have a fixed probability, for each vertex, of 'jumping' to that vertex at each step in the algorithm (rather than following a link out of that vertex).
AbstractIterativeScorerWithPriors(Hypergraph<V, E>, Function<? super E, ? extends Number>, Function<? super V, ? extends S>, double) - Constructor for class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorerWithPriors: Creates an instance for the specified graph, edge weights, vertex priors, and jump probability.
AbstractIterativeScorerWithPriors(Hypergraph<V, E>, Function<V, ? extends S>, double) - Constructor for class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorerWithPriors: Creates an instance for the specified graph, vertex priors, and jump probability, with edge weights specified by the subclass.
AbstractLayout<V,E> - Class in edu.uci.ics.jung.algorithms.layout: Abstract class for implementations of Layout.
AbstractLayout(Graph<V, E>) - Constructor for class edu.uci.ics.jung.algorithms.layout.AbstractLayout: Creates an instance for graph which does not initialize the vertex locations.
AbstractLayout(Graph<V, E>, Function<V, Point2D>) - Constructor for class edu.uci.ics.jung.algorithms.layout.AbstractLayout: Creates an instance for graph which initializes the vertex locations using initializer.
AbstractLayout(Graph<V, E>, Dimension) - Constructor for class edu.uci.ics.jung.algorithms.layout.AbstractLayout: Creates an instance for graph which sets the size of the layout to size.
AbstractLayout(Graph<V, E>, Function<V, Point2D>, Dimension) - Constructor for class edu.uci.ics.jung.algorithms.layout.AbstractLayout: Creates an instance for graph which initializes the vertex locations using initializer and sets the size of the layout to size.
AbstractRanker<V,E> - Class in edu.uci.ics.jung.algorithms.importance: Abstract class for algorithms that rank nodes or edges by some "importance" metric.
AbstractRanker() - Constructor for class edu.uci.ics.jung.algorithms.importance.AbstractRanker
acceptDisconnectedGraph(boolean) - Method in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer: Specifies whether this instance should accept vertices with no outgoing edges.
add(T) - Method in class edu.uci.ics.jung.algorithms.util.MapBinaryHeap: Inserts o into this collection.
addOneCandidateCluster(LinkedList<Set<V>>, Map<V, double[]>) - Method in class edu.uci.ics.jung.algorithms.cluster.VoltageClusterer: alternative to addTwoCandidateClusters(): cluster vertices by voltages into 2 clusters.
addTwoCandidateClusters(LinkedList<Set<V>>, Map<V, double[]>) - Method in class edu.uci.ics.jung.algorithms.cluster.VoltageClusterer: Do k-means with three intervals and pick the smaller two clusters (presumed to be on the ends); this is closer to the Wu-Huberman method.
adjustForGravity() - Method in class edu.uci.ics.jung.algorithms.layout.KKLayout: Shift all vertices so that the center of gravity is located at the center of the screen.
afterStep() - Method in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer
afterStep() - Method in class edu.uci.ics.jung.algorithms.scoring.HITSWithPriors: Code which is executed after each step.
afterStep() - Method in class edu.uci.ics.jung.algorithms.scoring.PageRankWithPriors: Cleans up after each step.
aggregateConstraint(V) - Method in class edu.uci.ics.jung.algorithms.metrics.StructuralHoles: The aggregate constraint on v.
AggregateLayout<V,E> - Class in edu.uci.ics.jung.algorithms.layout: A Layout implementation that combines multiple other layouts so that they may be manipulated as one layout.
AggregateLayout(Layout<V, E>) - Constructor for class edu.uci.ics.jung.algorithms.layout.AggregateLayout: Creates an instance backed by the specified delegate.
alpha - Variable in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorerWithPriors: The probability of making a 'jump' at each step.
alreadyDone - Variable in class edu.uci.ics.jung.algorithms.layout.TreeLayout
apply(Graph<V, E>) - Method in class edu.uci.ics.jung.algorithms.blockmodel.StructurallyEquivalent
apply(UndirectedGraph<V, E>) - Method in class edu.uci.ics.jung.algorithms.cluster.BicomponentClusterer: Extracts the bicomponents from the graph.
apply(Graph<V, E>) - Method in class edu.uci.ics.jung.algorithms.cluster.EdgeBetweennessClusterer: Finds the set of clusters which have the strongest "community structure".
apply(Graph<V, E>) - Method in class edu.uci.ics.jung.algorithms.cluster.WeakComponentClusterer: Extracts the weak components from a graph.
apply(Graph<V, E>) - Method in class edu.uci.ics.jung.algorithms.filters.EdgePredicateFilter
apply(Graph<V, E>) - Method in class edu.uci.ics.jung.algorithms.filters.KNeighborhoodFilter: Constructs an unassembled graph containing the k-neighborhood around the root node(s).
apply(Graph<V, E>) - Method in class edu.uci.ics.jung.algorithms.filters.VertexPredicateFilter
apply(V) - Method in class edu.uci.ics.jung.algorithms.layout.AbstractLayout
apply(V) - Method in class edu.uci.ics.jung.algorithms.layout.AggregateLayout: Returns the location of the vertex.
apply(V) - Method in class edu.uci.ics.jung.algorithms.layout.BalloonLayout
apply(V) - Method in class edu.uci.ics.jung.algorithms.layout.RadialTreeLayout
apply(V) - Method in class edu.uci.ics.jung.algorithms.layout.TreeLayout
apply(V) - Method in class edu.uci.ics.jung.algorithms.layout.util.RandomLocationTransformer
apply(VEPair<V, E>) - Method in class edu.uci.ics.jung.algorithms.scoring.util.DelegateToEdgeTransformer
apply(VEPair<V, E>) - Method in class edu.uci.ics.jung.algorithms.scoring.util.UniformDegreeWeight
apply(VEPair<V, E>) - Method in class edu.uci.ics.jung.algorithms.scoring.util.UniformInOut
apply(V) - Method in class edu.uci.ics.jung.algorithms.scoring.util.VertexScoreTransformer
apply(Graph<V, E>) - Method in class edu.uci.ics.jung.algorithms.shortestpath.PrimMinimumSpanningTree
apply(I) - Method in class edu.uci.ics.jung.algorithms.util.MapSettableTransformer
apply(Context<Graph<V, E>, E>) - Method in class edu.uci.ics.jung.algorithms.util.SelfLoopEdgePredicate
assignDefaultEdgeTransitionWeights() - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker
assignToClusters(Map<T, double[]>, Set<double[]>) - Method in class edu.uci.ics.jung.algorithms.util.KMeansClusterer: Assigns each object to the cluster whose centroid is closest to the object.
authority - Variable in class edu.uci.ics.jung.algorithms.scoring.HITS.Scores: The authority score for a vertex.
averageCounter - Variable in class edu.uci.ics.jung.algorithms.layout.SpringLayout2
averageDelta - Variable in class edu.uci.ics.jung.algorithms.layout.SpringLayout2
averageDistances(Hypergraph<V, E>, Distance<V>) - Static method in class edu.uci.ics.jung.algorithms.shortestpath.DistanceStatistics: For each vertex v in graph, calculates the average shortest path length from v to all other vertices in graph using the metric specified by d, and returns the results in a Map from vertices to Double values.
averageDistances(Hypergraph<V, E>) - Static method in class edu.uci.ics.jung.algorithms.shortestpath.DistanceStatistics: For each vertex v in g, calculates the average shortest path length from v to all other vertices in g, ignoring edge weights.
averaging - Variable in class edu.uci.ics.jung.algorithms.scoring.DistanceCentralityScorer: Specifies whether the values returned are the sum of the v-distances or the mean v-distance.

B

BalloonLayout<V,E> - Class in edu.uci.ics.jung.algorithms.layout: A Layout implementation that assigns positions to Tree or Forest vertices using associations with nested circles ("balloons").
BalloonLayout(Forest<V, E>) - Constructor for class edu.uci.ics.jung.algorithms.layout.BalloonLayout: Creates an instance based on the input forest.
BarabasiAlbertGenerator<V,E> - Class in edu.uci.ics.jung.algorithms.generators.random: Simple evolving scale-free random graph generator.
BarabasiAlbertGenerator(Supplier<Graph<V, E>>, Supplier<V>, Supplier<E>, int, int, int, Set<V>) - Constructor for class edu.uci.ics.jung.algorithms.generators.random.BarabasiAlbertGenerator: Constructs a new instance of the generator.
BarabasiAlbertGenerator(Supplier<Graph<V, E>>, Supplier<V>, Supplier<E>, int, int, Set<V>) - Constructor for class edu.uci.ics.jung.algorithms.generators.random.BarabasiAlbertGenerator: 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.
BarycenterScorer<V,E> - Class in edu.uci.ics.jung.algorithms.scoring: Assigns scores to each vertex according to the sum of its distances to all other vertices.
BarycenterScorer(Hypergraph<V, E>, Distance<V>) - Constructor for class edu.uci.ics.jung.algorithms.scoring.BarycenterScorer: Creates an instance with the specified graph and distance metric.
BarycenterScorer(Hypergraph<V, E>, Function<E, ? extends Number>) - Constructor for class edu.uci.ics.jung.algorithms.scoring.BarycenterScorer: Creates an instance with the specified graph and edge weights.
BarycenterScorer(Hypergraph<V, E>) - Constructor for class edu.uci.ics.jung.algorithms.scoring.BarycenterScorer: Creates an instance with the specified graph.
basePositions - Variable in class edu.uci.ics.jung.algorithms.layout.TreeLayout
BasicMapEntry<K,V> - Class in edu.uci.ics.jung.algorithms.util: An simple minimal implementation of Map.Entry.
BasicMapEntry(K, V) - Constructor for class edu.uci.ics.jung.algorithms.util.BasicMapEntry
BetweennessCentrality<V,E> - Class in edu.uci.ics.jung.algorithms.importance: Computes betweenness centrality for each vertex and edge in the graph.
BetweennessCentrality(Graph<V, E>) - Constructor for class edu.uci.ics.jung.algorithms.importance.BetweennessCentrality: Constructor which initializes the algorithm
BetweennessCentrality(Graph<V, E>, boolean) - Constructor for class edu.uci.ics.jung.algorithms.importance.BetweennessCentrality
BetweennessCentrality(Graph<V, E>, boolean, boolean) - Constructor for class edu.uci.ics.jung.algorithms.importance.BetweennessCentrality
BetweennessCentrality<V,E> - Class in edu.uci.ics.jung.algorithms.scoring: Computes betweenness centrality for each vertex and edge in the graph.
BetweennessCentrality(Graph<V, E>) - Constructor for class edu.uci.ics.jung.algorithms.scoring.BetweennessCentrality: Calculates betweenness scores based on the all-pairs unweighted shortest paths in the graph.
BetweennessCentrality(Graph<V, E>, Function<? super E, ? extends Number>) - Constructor for class edu.uci.ics.jung.algorithms.scoring.BetweennessCentrality: Calculates betweenness scores based on the all-pairs weighted shortest paths in the graph.
BFSDistanceLabeler<V,E> - Class in edu.uci.ics.jung.algorithms.shortestpath: Labels each node in the graph according to the BFS distance from the start node(s).
BFSDistanceLabeler() - Constructor for class edu.uci.ics.jung.algorithms.shortestpath.BFSDistanceLabeler: Creates a new BFS labeler for the specified graph and root set The distances are stored in the corresponding Vertex objects and are of type MutableInteger
BicomponentClusterer<V,E> - Class in edu.uci.ics.jung.algorithms.cluster: Finds all biconnected components (bicomponents) of an undirected graph.
BicomponentClusterer() - Constructor for class edu.uci.ics.jung.algorithms.cluster.BicomponentClusterer: Constructs a new bicomponent finder
buildTree() - Method in class edu.uci.ics.jung.algorithms.layout.RadialTreeLayout
buildTree() - Method in class edu.uci.ics.jung.algorithms.layout.TreeLayout
buildTree(V, int) - Method in class edu.uci.ics.jung.algorithms.layout.TreeLayout

C

cached - Variable in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance
calcAttraction(E) - Method in class edu.uci.ics.jung.algorithms.layout.FRLayout
calcAttraction(E) - Method in class edu.uci.ics.jung.algorithms.layout.FRLayout2
calcPositions(V) - Method in class edu.uci.ics.jung.algorithms.layout.FRLayout
calcPositions(V) - Method in class edu.uci.ics.jung.algorithms.layout.FRLayout2
calcRepulsion(V) - Method in class edu.uci.ics.jung.algorithms.layout.FRLayout
calcRepulsion(V) - Method in class edu.uci.ics.jung.algorithms.layout.FRLayout2
calculateRepulsion() - Method in class edu.uci.ics.jung.algorithms.layout.SpringLayout
canBeEquivalent(V, V) - Method in class edu.uci.ics.jung.algorithms.blockmodel.StructurallyEquivalent: This is a space for optimizations.
cartesianToPolar(Point2D) - Static method in class edu.uci.ics.jung.algorithms.layout.PolarPoint
cartesianToPolar(double, double) - Static method in class edu.uci.ics.jung.algorithms.layout.PolarPoint
CENTRALITY - Static variable in class edu.uci.ics.jung.algorithms.importance.BetweennessCentrality
CircleLayout<V,E> - Class in edu.uci.ics.jung.algorithms.layout: A Layout implementation that positions vertices equally spaced on a regular circle.
CircleLayout(Graph<V, E>) - Constructor for class edu.uci.ics.jung.algorithms.layout.CircleLayout
CircleLayout.CircleVertexData - Class in edu.uci.ics.jung.algorithms.layout
CircleVertexData() - Constructor for class edu.uci.ics.jung.algorithms.layout.CircleLayout.CircleVertexData
circleVertexDatas - Variable in class edu.uci.ics.jung.algorithms.layout.CircleLayout
clear() - Method in class edu.uci.ics.jung.algorithms.util.MapBinaryHeap
ClosenessCentrality<V,E> - Class in edu.uci.ics.jung.algorithms.scoring: Assigns scores to each vertex based on the mean distance to each other vertex.
ClosenessCentrality(Hypergraph<V, E>, Distance<V>) - Constructor for class edu.uci.ics.jung.algorithms.scoring.ClosenessCentrality: Creates an instance using the specified vertex/vertex distance metric.
ClosenessCentrality(Hypergraph<V, E>, Function<E, ? extends Number>) - Constructor for class edu.uci.ics.jung.algorithms.scoring.ClosenessCentrality: Creates an instance which measures distance using the specified edge weights.
ClosenessCentrality(Hypergraph<V, E>) - Constructor for class edu.uci.ics.jung.algorithms.scoring.ClosenessCentrality: Creates an instance which measures distance on the graph without edge weights.
cluster(int) - Method in class edu.uci.ics.jung.algorithms.cluster.VoltageClusterer: Clusters the vertices of g into num_clusters clusters, based on their connectivity.
cluster(Map<T, double[]>, int) - Method in class edu.uci.ics.jung.algorithms.util.KMeansClusterer: Returns a Collection of clusters, where each cluster is represented as a Map of Objects to locations in d-dimensional space.
cluster_internal(V, int) - Method in class edu.uci.ics.jung.algorithms.cluster.VoltageClusterer: Does the work of getCommunity and cluster.
clusteringCoefficients(Graph<V, E>) - Static method in class edu.uci.ics.jung.algorithms.metrics.Metrics: Returns a Map of vertices to their clustering coefficients.
codeToType - Static variable in class edu.uci.ics.jung.algorithms.metrics.TriadicCensus: For debugging purposes, this is copied straight out of the paper which means that they refer to triad types 1-16.
col_count - Variable in class edu.uci.ics.jung.algorithms.generators.Lattice2DGenerator
collapseVertexPartitions(VertexPartition<V, E>) - Method in class edu.uci.ics.jung.algorithms.transformation.VertexPartitionCollapser: Creates a new graph whose vertices correspond to the partitions of the supplied graph.
collectDisappearingPotential(V) - Method in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer: Collects the 'potential' from v (its current value) if it has no outgoing edges; this can then be redistributed among the other vertices as a means of normalization.
collectDisappearingPotential(V) - Method in class edu.uci.ics.jung.algorithms.scoring.HITSWithPriors: Collects the "disappearing potential" associated with vertices that have either no incoming edges, no outgoing edges, or both.
collectDisappearingPotential(V) - Method in class edu.uci.ics.jung.algorithms.scoring.PageRankWithPriors: Collects the "disappearing potential" associated with vertices that have no outgoing edges.
compare(V, V) - Method in class edu.uci.ics.jung.algorithms.cluster.VoltageClusterer.MapValueArrayComparator
compare(V, V) - Method in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance.VertexComparator
compareTo(Object) - Method in class edu.uci.ics.jung.algorithms.importance.Ranking: Compares two ranking based on the rank score.
componentResized(ComponentEvent) - Method in class edu.uci.ics.jung.algorithms.layout.SpringLayout.SpringDimensionChecker
computeBetweenness(Graph<V, E>) - Method in class edu.uci.ics.jung.algorithms.importance.BetweennessCentrality
computeBetweenness(Queue<V>, Function<? super E, ? extends Number>) - Method in class edu.uci.ics.jung.algorithms.scoring.BetweennessCentrality
computeWeightedPathsFromSource(V, int) - Method in class edu.uci.ics.jung.algorithms.importance.WeightedNIPaths
constraint(V) - Method in class edu.uci.ics.jung.algorithms.metrics.StructuralHoles: Burt's constraint measure (equation 2.4, page 55 of Burt, 1992).
contains(Object) - Method in class edu.uci.ics.jung.algorithms.util.MapBinaryHeap
convergence_threshold - Variable in class edu.uci.ics.jung.algorithms.util.KMeansClusterer
converse_depth - Variable in class edu.uci.ics.jung.algorithms.cluster.BicomponentClusterer
cosine(double[], double[]) - Static method in class edu.uci.ics.jung.algorithms.util.DiscreteDistribution: Returns the cosine distance between the two specified distributions, which must have the same number of elements.
create(Collection<T>) - Static method in class edu.uci.ics.jung.algorithms.util.Indexer: Returns a BiMap mapping each element of the collection to its index as encountered while iterating over the collection.
create(Collection<T>, int) - Static method in class edu.uci.ics.jung.algorithms.util.Indexer: Returns a BiMap mapping each element of the collection to its index as encountered while iterating over the collection.
createAllInducedSubgraphs(Collection<? extends Collection<V>>, G) - Static method in class edu.uci.ics.jung.algorithms.filters.FilterUtils: Creates the induced subgraphs of graph associated with each element of vertex_collections.
createInducedSubgraph(Collection<V>, G) - Static method in class edu.uci.ics.jung.algorithms.filters.FilterUtils: Creates the induced subgraph from graph whose vertex set is equal to vertices.
createRecord(V, E, double) - Method in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance.SourceData
createRecord(V, E, double) - Method in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraShortestPath.SourcePathData
currentIteration - Variable in class edu.uci.ics.jung.algorithms.layout.SpringLayout2

D

DAGLayout<V,E> - Class in edu.uci.ics.jung.algorithms.layout: An implementation of Layout suitable for tree-like directed acyclic graphs.
DAGLayout(Graph<V, E>) - Constructor for class edu.uci.ics.jung.algorithms.layout.DAGLayout
DEFAULT_DISTX - Static variable in class edu.uci.ics.jung.algorithms.layout.TreeLayout: The default horizontal vertex spacing.
DEFAULT_DISTY - Static variable in class edu.uci.ics.jung.algorithms.layout.TreeLayout: The default vertical vertex spacing.
DEFAULT_THRESHOLD - Static variable in class edu.uci.ics.jung.algorithms.util.WeightedChoice: The default minimum value that is treated as a valid probability (as opposed to rounding error from floating-point operations).
DegreeScorer<V> - Class in edu.uci.ics.jung.algorithms.scoring: Assigns a score to each vertex equal to its degree.
DegreeScorer(Hypergraph<V, ?>) - Constructor for class edu.uci.ics.jung.algorithms.scoring.DegreeScorer: Creates an instance for the specified graph.
delegate - Variable in class edu.uci.ics.jung.algorithms.layout.AggregateLayout
delegate - Variable in class edu.uci.ics.jung.algorithms.layout.LayoutDecorator
delegate - Variable in class edu.uci.ics.jung.algorithms.scoring.util.DelegateToEdgeTransformer: The Function to which this instance delegates its function.
DelegateToEdgeTransformer<V,E> - Class in edu.uci.ics.jung.algorithms.scoring.util: A Transformer<VEPair,Number that delegates its operation to a Transformer<E,Number>.
DelegateToEdgeTransformer(Function<? super E, ? extends Number>) - Constructor for class edu.uci.ics.jung.algorithms.scoring.util.DelegateToEdgeTransformer: Creates an instance with the specified delegate Function.
dfs_num - Variable in class edu.uci.ics.jung.algorithms.cluster.BicomponentClusterer
diameter - Variable in class edu.uci.ics.jung.algorithms.layout.KKLayout: The diameter of the visible graph.
diameter(Hypergraph<V, E>, Distance<V>, boolean) - Static method in class edu.uci.ics.jung.algorithms.shortestpath.DistanceStatistics: Returns the diameter of g using the metric specified by d.
diameter(Hypergraph<V, E>, Distance<V>) - Static method in class edu.uci.ics.jung.algorithms.shortestpath.DistanceStatistics: Returns the diameter of g using the metric specified by d.
diameter(Hypergraph<V, E>) - Static method in class edu.uci.ics.jung.algorithms.shortestpath.DistanceStatistics: Returns the diameter of g, ignoring edge weights.
DijkstraDistance<V,E> - Class in edu.uci.ics.jung.algorithms.shortestpath: Calculates distances in a specified graph, using Dijkstra's single-source-shortest-path algorithm.
DijkstraDistance(Hypergraph<V, E>, Function<? super E, ? extends Number>, boolean) - Constructor for class edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance: Creates an instance of DijkstraShortestPath for the specified graph and the specified method of extracting weights from edges, which caches results locally if and only if cached is true.
DijkstraDistance(Hypergraph<V, E>, Function<? super E, ? extends Number>) - Constructor for class edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance: Creates an instance of DijkstraShortestPath for the specified graph and the specified method of extracting weights from edges, which caches results locally.
DijkstraDistance(Graph<V, E>) - Constructor for class edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance: Creates an instance of DijkstraShortestPath for the specified unweighted graph (that is, all weights 1) which caches results locally.
DijkstraDistance(Graph<V, E>, boolean) - Constructor for class edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance: Creates an instance of DijkstraShortestPath for the specified unweighted graph (that is, all weights 1) which caches results locally.
DijkstraDistance.SourceData - Class in edu.uci.ics.jung.algorithms.shortestpath: For a given source vertex, holds the estimated and final distances, tentative and final assignments of incoming edges on the shortest path from the source vertex, and a priority queue (ordered by estimated distance) of the vertices for which distances are unknown.
DijkstraDistance.VertexComparator<V> - Class in edu.uci.ics.jung.algorithms.shortestpath: Compares according to distances, so that the BinaryHeap knows how to order the tree.
DijkstraShortestPath<V,E> - Class in edu.uci.ics.jung.algorithms.shortestpath: Calculates distances and shortest paths using Dijkstra's single-source-shortest-path algorithm.
DijkstraShortestPath(Graph<V, E>, Function<E, ? extends Number>, boolean) - Constructor for class edu.uci.ics.jung.algorithms.shortestpath.DijkstraShortestPath: Creates an instance of DijkstraShortestPath for the specified graph and the specified method of extracting weights from edges, which caches results locally if and only if cached is true.
DijkstraShortestPath(Graph<V, E>, Function<E, ? extends Number>) - Constructor for class edu.uci.ics.jung.algorithms.shortestpath.DijkstraShortestPath: Creates an instance of DijkstraShortestPath for the specified graph and the specified method of extracting weights from edges, which caches results locally.
DijkstraShortestPath(Graph<V, E>) - Constructor for class edu.uci.ics.jung.algorithms.shortestpath.DijkstraShortestPath: Creates an instance of DijkstraShortestPath for the specified unweighted graph (that is, all weights 1) which caches results locally.
DijkstraShortestPath(Graph<V, E>, boolean) - Constructor for class edu.uci.ics.jung.algorithms.shortestpath.DijkstraShortestPath: Creates an instance of DijkstraShortestPath for the specified unweighted graph (that is, all weights 1) which caches results locally.
DijkstraShortestPath.SourcePathData - Class in edu.uci.ics.jung.algorithms.shortestpath: For a given source vertex, holds the estimated and final distances, tentative and final assignments of incoming edges on the shortest path from the source vertex, and a priority queue (ordered by estimaed distance) of the vertices for which distances are unknown.
DirectionTransformer - Class in edu.uci.ics.jung.algorithms.transformation: Functions for transforming graphs into directed or undirected graphs.
DirectionTransformer() - Constructor for class edu.uci.ics.jung.algorithms.transformation.DirectionTransformer
disappearing_potential - Variable in class edu.uci.ics.jung.algorithms.scoring.HITSWithPriors: The sum of the potential, at each step, associated with vertices with no outedges (authority) or no inedges (hub).
disappearing_potential - Variable in class edu.uci.ics.jung.algorithms.scoring.PageRankWithPriors: Maintains the amount of potential associated with vertices with no out-edges.
DiscreteDistribution - Class in edu.uci.ics.jung.algorithms.util: A utility class for calculating properties of discrete distributions.
DiscreteDistribution() - Constructor for class edu.uci.ics.jung.algorithms.util.DiscreteDistribution
dist_reached - Variable in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance.SourceData
distance - Variable in class edu.uci.ics.jung.algorithms.layout.KKLayout: Retrieves graph distances between vertices of the visible graph
distance - Variable in class edu.uci.ics.jung.algorithms.scoring.DistanceCentralityScorer: The metric to use for specifying the distance between pairs of vertices.
Distance<V> - Interface in edu.uci.ics.jung.algorithms.shortestpath: An interface for classes which calculate the distance between one vertex and another.
DistanceCentralityScorer<V,E> - Class in edu.uci.ics.jung.algorithms.scoring: Assigns scores to vertices based on their distances to each other vertex in the graph.
DistanceCentralityScorer(Hypergraph<V, E>, Distance<V>, boolean, boolean, boolean) - Constructor for class edu.uci.ics.jung.algorithms.scoring.DistanceCentralityScorer: Creates an instance with the specified graph, distance metric, and averaging behavior.
DistanceCentralityScorer(Hypergraph<V, E>, Distance<V>, boolean) - Constructor for class edu.uci.ics.jung.algorithms.scoring.DistanceCentralityScorer: Equivalent to this(graph, distance, averaging, true, true).
DistanceCentralityScorer(Hypergraph<V, E>, Function<E, ? extends Number>, boolean, boolean, boolean) - Constructor for class edu.uci.ics.jung.algorithms.scoring.DistanceCentralityScorer: Creates an instance with the specified graph and averaging behavior whose vertex distances are calculated based on the specified edge weights.
DistanceCentralityScorer(Hypergraph<V, E>, Function<E, ? extends Number>, boolean) - Constructor for class edu.uci.ics.jung.algorithms.scoring.DistanceCentralityScorer: Equivalent to this(graph, edge_weights, averaging, true, true).
DistanceCentralityScorer(Hypergraph<V, E>, boolean, boolean, boolean) - Constructor for class edu.uci.ics.jung.algorithms.scoring.DistanceCentralityScorer: Creates an instance with the specified graph and averaging behavior whose vertex distances are calculated on the unweighted graph.
DistanceCentralityScorer(Hypergraph<V, E>, boolean) - Constructor for class edu.uci.ics.jung.algorithms.scoring.DistanceCentralityScorer: Equivalent to this(graph, averaging, true, true).
distances - Variable in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance.SourceData
DistanceStatistics - Class in edu.uci.ics.jung.algorithms.shortestpath: Statistics relating to vertex-vertex distances in a graph.
DistanceStatistics() - Constructor for class edu.uci.ics.jung.algorithms.shortestpath.DistanceStatistics
distX - Variable in class edu.uci.ics.jung.algorithms.layout.TreeLayout: The horizontal vertex spacing.
distY - Variable in class edu.uci.ics.jung.algorithms.layout.TreeLayout: The vertical vertex spacing.
done() - Method in class edu.uci.ics.jung.algorithms.layout.AggregateLayout
done() - Method in class edu.uci.ics.jung.algorithms.layout.DAGLayout: Override incrementsAreDone so that we can eventually stop.
done() - Method in class edu.uci.ics.jung.algorithms.layout.FRLayout
done() - Method in class edu.uci.ics.jung.algorithms.layout.FRLayout2
done() - Method in class edu.uci.ics.jung.algorithms.layout.ISOMLayout: Returns true if the vertex positions are no longer being updated.
done() - Method in class edu.uci.ics.jung.algorithms.layout.KKLayout
done() - Method in class edu.uci.ics.jung.algorithms.layout.LayoutDecorator
done() - Method in class edu.uci.ics.jung.algorithms.layout.SpringLayout
done - Variable in class edu.uci.ics.jung.algorithms.layout.SpringLayout2
done() - Method in class edu.uci.ics.jung.algorithms.layout.SpringLayout2
done() - Method in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer: Returns true if the total number of iterations is greater than or equal to max_iterations or if the maximum value change observed is less than tolerance.
done() - Method in interface edu.uci.ics.jung.algorithms.util.IterativeContext
done() - Method in class edu.uci.ics.jung.algorithms.util.IterativeProcess
dx - Variable in class edu.uci.ics.jung.algorithms.layout.SpringLayout.SpringVertexData: movement speed, x
dy - Variable in class edu.uci.ics.jung.algorithms.layout.SpringLayout.SpringVertexData: movement speed, y

E

edge_factory - Variable in class edu.uci.ics.jung.algorithms.generators.Lattice2DGenerator
edge_factory - Variable in class edu.uci.ics.jung.algorithms.transformation.VertexPartitionCollapser
edge_pred - Variable in class edu.uci.ics.jung.algorithms.filters.EdgePredicateFilter
edge_scores - Variable in class edu.uci.ics.jung.algorithms.scoring.BetweennessCentrality
edge_weight - Variable in class edu.uci.ics.jung.algorithms.metrics.StructuralHoles
edge_weights - Variable in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer: The edge weights used by this algorithm.
EdgeBetweennessClusterer<V,E> - Class in edu.uci.ics.jung.algorithms.cluster: An algorithm for computing clusters (community structure) in graphs based on edge betweenness.
EdgeBetweennessClusterer(int) - Constructor for class edu.uci.ics.jung.algorithms.cluster.EdgeBetweennessClusterer: Constructs a new clusterer for the specified graph.
edgedx - Variable in class edu.uci.ics.jung.algorithms.layout.SpringLayout.SpringVertexData
edgedy - Variable in class edu.uci.ics.jung.algorithms.layout.SpringLayout.SpringVertexData
edgeFactory - Variable in class edu.uci.ics.jung.algorithms.generators.random.BarabasiAlbertGenerator
EdgePredicateFilter<V,E> - Class in edu.uci.ics.jung.algorithms.filters: Transforms the input graph into one which contains only those edges that pass the specified Predicate.
EdgePredicateFilter(Predicate<E>) - Constructor for class edu.uci.ics.jung.algorithms.filters.EdgePredicateFilter: Creates an instance based on the specified edge Predicate.
edgeRankScores - Variable in class edu.uci.ics.jung.algorithms.importance.AbstractRanker
EdgeScorer<E,S> - Interface in edu.uci.ics.jung.algorithms.scoring: An interface for algorithms that assign scores to edges.
EdmondsKarpMaxFlow<V,E> - Class in edu.uci.ics.jung.algorithms.flows: Implements the Edmonds-Karp maximum flow algorithm for solving the maximum flow problem.
EdmondsKarpMaxFlow(DirectedGraph<V, E>, V, V, Function<E, Number>, Map<E, Number>, Supplier<E>) - Constructor for class edu.uci.ics.jung.algorithms.flows.EdmondsKarpMaxFlow: Constructs a new instance of the algorithm solver for a given graph, source, and sink.
edu.uci.ics.jung.algorithms.blockmodel - package edu.uci.ics.jung.algorithms.blockmodel: Support for establishing and maintaining graph element equivalence (such as in blockmodeling).
edu.uci.ics.jung.algorithms.cluster - package edu.uci.ics.jung.algorithms.cluster: Mechanisms for identifying clusters in graphs.
edu.uci.ics.jung.algorithms.filters - package edu.uci.ics.jung.algorithms.filters: Filtering mechanisms that produce subgraphs of an original graph.
edu.uci.ics.jung.algorithms.flows - package edu.uci.ics.jung.algorithms.flows: Methods for calculating properties relating to network flows (such as max flow/min cut).
edu.uci.ics.jung.algorithms.generators - package edu.uci.ics.jung.algorithms.generators: Methods for generating new (often random) graphs with various properties.
edu.uci.ics.jung.algorithms.generators.random - package edu.uci.ics.jung.algorithms.generators.random: Methods for generating random graphs with various properties.
edu.uci.ics.jung.algorithms.importance - package edu.uci.ics.jung.algorithms.importance
edu.uci.ics.jung.algorithms.layout - package edu.uci.ics.jung.algorithms.layout: Algorithms for assigning 2D coordinates (typically used for graph visualizations) to vertices.
edu.uci.ics.jung.algorithms.layout.util - package edu.uci.ics.jung.algorithms.layout.util: Utility classes for updating layout positions.
edu.uci.ics.jung.algorithms.metrics - package edu.uci.ics.jung.algorithms.metrics: Specialized measures for graph properties.
edu.uci.ics.jung.algorithms.scoring - package 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 - package edu.uci.ics.jung.algorithms.scoring.util: Utility functions for assigning scores to graph elements.
edu.uci.ics.jung.algorithms.shortestpath - package edu.uci.ics.jung.algorithms.shortestpath: Provides interfaces and classes for calculating (geodesic) distances and shortest paths.
edu.uci.ics.jung.algorithms.transformation - package edu.uci.ics.jung.algorithms.transformation: Mechanisms for graph transformation.
edu.uci.ics.jung.algorithms.util - package edu.uci.ics.jung.algorithms.util: Provides general algorithmic utilities.
effectiveSize(V) - Method in class edu.uci.ics.jung.algorithms.metrics.StructuralHoles: Burt's measure of the effective size of a vertex's network.
efficiency(V) - Method in class edu.uci.ics.jung.algorithms.metrics.StructuralHoles: Returns the effective size of v divided by the number of alters in v's network.
EigenvectorCentrality<V,E> - Class in edu.uci.ics.jung.algorithms.scoring: Calculates eigenvector centrality for each vertex in the graph.
EigenvectorCentrality(Hypergraph<V, E>, Function<E, ? extends Number>) - Constructor for class edu.uci.ics.jung.algorithms.scoring.EigenvectorCentrality: Creates an instance with the specified graph and edge weights.
EigenvectorCentrality(Hypergraph<V, E>) - Constructor for class edu.uci.ics.jung.algorithms.scoring.EigenvectorCentrality: Creates an instance with the specified graph and default edge weights.
element() - Method in class edu.uci.ics.jung.algorithms.util.MapBinaryHeap
elementAccessor - Variable in class edu.uci.ics.jung.algorithms.layout.ISOMLayout
enableCaching(boolean) - Method in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance: Specifies whether or not this instance of DijkstraShortestPath should cache its results (final and partial) for future reference.
entropy(double[]) - Static method in class edu.uci.ics.jung.algorithms.util.DiscreteDistribution: Returns the entropy of this distribution.
EppsteinPowerLawGenerator<V,E> - Class in edu.uci.ics.jung.algorithms.generators.random: Graph generator that generates undirected graphs with power-law degree distributions.
EppsteinPowerLawGenerator(Supplier<Graph<V, E>>, Supplier<V>, Supplier<E>, int, int, int) - Constructor for class edu.uci.ics.jung.algorithms.generators.random.EppsteinPowerLawGenerator: Creates an instance with the specified factories and specifications.
equals(Object) - Method in class edu.uci.ics.jung.algorithms.util.BasicMapEntry
ErdosRenyiGenerator<V,E> - Class in edu.uci.ics.jung.algorithms.generators.random: Generates a random graph using the Erdos-Renyi binomial model (each pair of vertices is connected with probability p).
ErdosRenyiGenerator(Supplier<UndirectedGraph<V, E>>, Supplier<V>, Supplier<E>, int, double) - Constructor for class edu.uci.ics.jung.algorithms.generators.random.ErdosRenyiGenerator
estimatedDistances - Variable in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance.SourceData
evaluate() - Method in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer: Steps through this scoring algorithm until a termination condition is reached.
evaluate() - Method in class edu.uci.ics.jung.algorithms.util.IterativeProcess: Performs the iterative process.
evolveGraph(int) - Method in interface edu.uci.ics.jung.algorithms.generators.EvolvingGraphGenerator: Instructs the algorithm to evolve the graph N steps.
evolveGraph(int) - Method in class edu.uci.ics.jung.algorithms.generators.random.BarabasiAlbertGenerator
EvolvingGraphGenerator<V,E> - Interface in edu.uci.ics.jung.algorithms.generators: An interface for algorithms that generate graphs that evolve iteratively.

F

Filter<V,E> - Interface in edu.uci.ics.jung.algorithms.filters: An interface for classes that return a subset of the input Graph as a Graph.
FilterUtils - Class in edu.uci.ics.jung.algorithms.filters: Utility methods relating to filtering.
FilterUtils() - Constructor for class edu.uci.ics.jung.algorithms.filters.FilterUtils
finalizeIterations() - Method in class edu.uci.ics.jung.algorithms.flows.EdmondsKarpMaxFlow
finalizeIterations() - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker
finalizeIterations() - Method in class edu.uci.ics.jung.algorithms.importance.RelativeAuthorityRanker: Cleans up all of the prior rank scores on finalize.
finalizeIterations() - Method in class edu.uci.ics.jung.algorithms.util.IterativeProcess: Perform eventual clean-up operations (must be implement by subclass when needed).
findBiconnectedComponents(UndirectedGraph<V, E>, V, Set<Set<V>>) - Method in class edu.uci.ics.jung.algorithms.cluster.BicomponentClusterer: Stores, in bicomponents, all the biconnected components that are reachable from v.
findRoot(Graph<V, E>) - Method in class edu.uci.ics.jung.algorithms.shortestpath.PrimMinimumSpanningTree
foldHypergraphEdges(Hypergraph<V, E>, Supplier<Graph<V, Collection<E>>>) - Static method in class edu.uci.ics.jung.algorithms.transformation.FoldingTransformer: Creates a Graph which is an edge-folded version of h, where hyperedges are replaced by k-cliques in the output graph.
foldHypergraphEdges(Hypergraph<V, E>, Supplier<Graph<V, E>>, Supplier<E>) - Static method in class edu.uci.ics.jung.algorithms.transformation.FoldingTransformer: Creates a Graph which is an edge-folded version of h, where hyperedges are replaced by k-cliques in the output graph.
foldHypergraphVertices(Hypergraph<V, E>, Supplier<Graph<E, F>>, Supplier<F>) - Static method in class edu.uci.ics.jung.algorithms.transformation.FoldingTransformer: Creates a Graph which is a vertex-folded version of h, whose vertices are the input's hyperedges and whose edges are induced by adjacent hyperedges in the input.
foldHypergraphVertices(Hypergraph<V, E>, Supplier<Graph<E, Collection<V>>>) - Method in class edu.uci.ics.jung.algorithms.transformation.FoldingTransformer: Creates a Graph which is a vertex-folded version of h, whose vertices are the input's hyperedges and whose edges are induced by adjacent hyperedges in the input.
FoldingTransformer<V,E> - Class in edu.uci.ics.jung.algorithms.transformation: Methods for creating a "folded" graph based on a k-partite graph or a hypergraph.
FoldingTransformer() - Constructor for class edu.uci.ics.jung.algorithms.transformation.FoldingTransformer
foldKPartiteGraph(KPartiteGraph<V, E>, Predicate<V>, Supplier<Graph<V, E>>, Supplier<E>) - Static method in class edu.uci.ics.jung.algorithms.transformation.FoldingTransformer: Converts g into a unipartite graph whose vertex set is the vertices of g's partition p.
foldKPartiteGraph(KPartiteGraph<V, E>, Predicate<V>, Supplier<Graph<V, Collection<V>>>) - Static method in class edu.uci.ics.jung.algorithms.transformation.FoldingTransformer: Converts g into a unipartite graph whose vertices are the vertices of g's partition p, and whose edges consist of collections of the intermediate vertices from other partitions.
force_multiplier - Variable in class edu.uci.ics.jung.algorithms.layout.SpringLayout
forest - Variable in class edu.uci.ics.jung.algorithms.shortestpath.MinimumSpanningForest
forest - Variable in class edu.uci.ics.jung.algorithms.shortestpath.MinimumSpanningForest2
FRLayout<V,E> - Class in edu.uci.ics.jung.algorithms.layout: Implements the Fruchterman-Reingold force-directed algorithm for node layout.
FRLayout(Graph<V, E>) - Constructor for class edu.uci.ics.jung.algorithms.layout.FRLayout
FRLayout(Graph<V, E>, Dimension) - Constructor for class edu.uci.ics.jung.algorithms.layout.FRLayout
FRLayout.FRVertexData - Class in edu.uci.ics.jung.algorithms.layout
FRLayout2<V,E> - Class in edu.uci.ics.jung.algorithms.layout: Implements the Fruchterman-Reingold force-directed algorithm for node layout.
FRLayout2(Graph<V, E>) - Constructor for class edu.uci.ics.jung.algorithms.layout.FRLayout2
FRLayout2(Graph<V, E>, Dimension) - Constructor for class edu.uci.ics.jung.algorithms.layout.FRLayout2
frVertexData - Variable in class edu.uci.ics.jung.algorithms.layout.FRLayout
FRVertexData() - Constructor for class edu.uci.ics.jung.algorithms.layout.FRLayout.FRVertexData
frVertexData - Variable in class edu.uci.ics.jung.algorithms.layout.FRLayout2

G

g - Variable in class edu.uci.ics.jung.algorithms.cluster.VoltageClusterer
g - Variable in class edu.uci.ics.jung.algorithms.metrics.StructuralHoles
g - Variable in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance
generateMixedRandomGraph(Supplier<Graph<V, E>>, Supplier<V>, Supplier<E>, Map<E, Number>, int, Set<V>) - Static method in class edu.uci.ics.jung.algorithms.generators.random.MixedRandomGraphGenerator: Returns a random mixed-mode graph.
get() - Method in class edu.uci.ics.jung.algorithms.generators.Lattice2DGenerator: Generates a graph based on the constructor-specified settings.
get() - Method in class edu.uci.ics.jung.algorithms.generators.random.BarabasiAlbertGenerator
get() - Method in class edu.uci.ics.jung.algorithms.generators.random.EppsteinPowerLawGenerator: Generates a graph whose degree distribution approximates a power-law.
get() - Method in class edu.uci.ics.jung.algorithms.generators.random.ErdosRenyiGenerator: Returns a graph in which each pair of vertices is connected by an undirected edge with the probability specified by the constructor.
get() - Method in class edu.uci.ics.jung.algorithms.generators.random.KleinbergSmallWorldGenerator: Generates a random small world network according to the parameters given
get(Layout<V, E>) - Method in class edu.uci.ics.jung.algorithms.layout.AggregateLayout
getAdjustedIncidentCount(E) - Method in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer: Returns the effective number of vertices incident to this edge.
getAdjustForGravity() - Method in class edu.uci.ics.jung.algorithms.layout.KKLayout
getAlpha() - Method in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorerWithPriors: Returns the probability of making a 'jump' (non-link-following step).
getAngle() - Method in class edu.uci.ics.jung.algorithms.layout.CircleLayout.CircleVertexData
getCenter(V) - Method in class edu.uci.ics.jung.algorithms.layout.BalloonLayout
getCenter() - Method in class edu.uci.ics.jung.algorithms.layout.TreeLayout
getCircleData(V) - Method in class edu.uci.ics.jung.algorithms.layout.CircleLayout
getCol(int) - Method in class edu.uci.ics.jung.algorithms.generators.Lattice2DGenerator
getCommunity(V) - Method in class edu.uci.ics.jung.algorithms.cluster.VoltageClusterer
getConnectionCount() - Method in class edu.uci.ics.jung.algorithms.generators.random.KleinbergSmallWorldGenerator
getConvergenceThreshold() - Method in class edu.uci.ics.jung.algorithms.util.KMeansClusterer
getCounts(DirectedGraph<V, E>) - Static method in class edu.uci.ics.jung.algorithms.metrics.TriadicCensus: Returns an array whose ith element (for i in [1,16]) is the number of occurrences of the corresponding triad type in g.
getCurrentRankScore(V) - Method in class edu.uci.ics.jung.algorithms.importance.KStepMarkov
getCurrentValue(V) - Method in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer: Gets the current value for this vertex
getDelegate() - Method in class edu.uci.ics.jung.algorithms.layout.AggregateLayout
getDelegate() - Method in class edu.uci.ics.jung.algorithms.layout.LayoutDecorator
getDesiredPrecision() - Method in class edu.uci.ics.jung.algorithms.util.IterativeProcess
getDistance(Hypergraph<V, E>, V) - Method in class edu.uci.ics.jung.algorithms.shortestpath.BFSDistanceLabeler: Given a vertex, returns the shortest distance from any node in the root set to v
getDistance(V, V) - Method in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance: Returns the length of a shortest path from the source to the target vertex, or null if the target is not reachable from the source.
getDistance(V, V) - Method in interface edu.uci.ics.jung.algorithms.shortestpath.Distance: Returns the distance from the source vertex to the target vertex.
getDistance(V, V) - Method in class edu.uci.ics.jung.algorithms.shortestpath.UnweightedShortestPath
getDistanceDecorator() - Method in class edu.uci.ics.jung.algorithms.shortestpath.BFSDistanceLabeler: Must be called after labelDistances in order to contain valid data.
getDistanceMap(V, Collection<V>) - Method in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance: Returns a Map from each element t of targets to the shortest-path distance from source to t.
getDistanceMap(V) - Method in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance: Returns a LinkedHashMap which maps each vertex in the graph (including the source vertex) to its distance from the source vertex.
getDistanceMap(V, int) - Method in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance: Returns a LinkedHashMap which maps each of the closest numDist vertices to the source vertex in the graph (including the source vertex) to its distance from the source vertex.
getDistanceMap(V) - Method in interface edu.uci.ics.jung.algorithms.shortestpath.Distance: Returns a Map which maps each vertex in the graph (including the source vertex) to its distance (represented as a Number) from source.
getDistanceMap(V) - Method in class edu.uci.ics.jung.algorithms.shortestpath.UnweightedShortestPath
getE() - Method in class edu.uci.ics.jung.algorithms.scoring.util.VEPair
getEdge(Layout<V, E>, double, double) - Method in interface edu.uci.ics.jung.algorithms.layout.GraphElementAccessor
getEdge(Layout<V, E>, double, double) - Method in class edu.uci.ics.jung.algorithms.layout.RadiusGraphElementAccessor
getEdge(Layout<V, E>, double, double, double) - Method in class edu.uci.ics.jung.algorithms.layout.RadiusGraphElementAccessor: Gets the vertex nearest to the location of the (x,y) location selected, whose endpoints are < maxDistance.
getEdgeRankScore(E) - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker
getEdgeRankScore(E, Object) - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker
getEdgeRankScores() - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker
getEdgeRankScores(Object) - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker
getEdgeScore(E) - Method in class edu.uci.ics.jung.algorithms.scoring.BetweennessCentrality
getEdgeScore(E) - Method in interface edu.uci.ics.jung.algorithms.scoring.EdgeScorer
getEdgesRemoved() - Method in class edu.uci.ics.jung.algorithms.cluster.EdgeBetweennessClusterer: Retrieves the list of all edges that were removed (assuming extract(...) was previously called).
getEdgesToCheck(V) - Method in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance: Returns the set of edges incident to v that should be tested.
getEdgeWeight(E) - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker
getEdgeWeight(V, E) - Method in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer: Gets the edge weight for e in the context of its (incident) vertex v.
getEdgeWeights() - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker
getEdgeWeights() - Method in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer: Returns the Function that this instance uses to associate edge weights with each edge.
getEquivalentPairs(Graph<V, ?>) - Method in class edu.uci.ics.jung.algorithms.blockmodel.StructurallyEquivalent: 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.
getExchangeVertices() - Method in class edu.uci.ics.jung.algorithms.layout.KKLayout
getFlowGraph() - Method in class edu.uci.ics.jung.algorithms.flows.EdmondsKarpMaxFlow
getForceMultiplier() - Method in class edu.uci.ics.jung.algorithms.layout.SpringLayout
getForest() - Method in class edu.uci.ics.jung.algorithms.shortestpath.MinimumSpanningForest
getForest() - Method in class edu.uci.ics.jung.algorithms.shortestpath.MinimumSpanningForest2
getFRData(V) - Method in class edu.uci.ics.jung.algorithms.layout.FRLayout
getGraph() - Method in class edu.uci.ics.jung.algorithms.blockmodel.VertexPartition: Returns the graph on which the partition is defined.
getGraph() - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker
getGraph() - Method in class edu.uci.ics.jung.algorithms.layout.AbstractLayout
getGraph() - Method in class edu.uci.ics.jung.algorithms.layout.AggregateLayout
getGraph() - Method in interface edu.uci.ics.jung.algorithms.layout.Layout
getGraph() - Method in class edu.uci.ics.jung.algorithms.layout.LayoutDecorator
getGraph() - Method in class edu.uci.ics.jung.algorithms.layout.TreeLayout
getGridEdgeCount() - Method in class edu.uci.ics.jung.algorithms.generators.Lattice2DGenerator: Returns the number of edges found in a lattice of this generator's specifications.
getHITSUniformRootPrior(Collection<V>) - Static method in class edu.uci.ics.jung.algorithms.scoring.util.ScoringUtils: Returns a Function that hub and authority values of 1/roots.size() to each element of roots.
getIncomingEdge(V, V) - Method in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraShortestPath: Returns the last edge on a shortest path from source to target, or null if target is not reachable from source.
getIncomingEdgeMap(V) - Method in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraShortestPath: Returns a LinkedHashMap which maps each vertex in the graph (including the source vertex) to the last edge on the shortest path from the source vertex.
getIncomingEdgeMap(V, int) - Method in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraShortestPath: Returns a LinkedHashMap which maps each of the closest numDests vertices to the source vertex in the graph (including the source vertex) to the incoming edge along the path from that vertex.
getIncomingEdgeMap(V) - Method in interface edu.uci.ics.jung.algorithms.shortestpath.ShortestPath: Returns a map from vertices to the last edge on the shortest path to that vertex starting from source.
getIncomingEdgeMap(V) - Method in class edu.uci.ics.jung.algorithms.shortestpath.UnweightedShortestPath
getIndex(int, int) - Method in class edu.uci.ics.jung.algorithms.generators.Lattice2DGenerator
getISOMVertexData(V) - Method in class edu.uci.ics.jung.algorithms.layout.ISOMLayout
getIterations() - Method in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer: Returns the number of iterations that this instance has used so far.
getIterations() - Method in class edu.uci.ics.jung.algorithms.util.IterativeProcess
getKey() - Method in class edu.uci.ics.jung.algorithms.util.BasicMapEntry
getLayouts() - Method in class edu.uci.ics.jung.algorithms.layout.AggregateLayout
getMaxFlow() - Method in class edu.uci.ics.jung.algorithms.flows.EdmondsKarpMaxFlow
getMaximumIterations() - Method in class edu.uci.ics.jung.algorithms.util.IterativeProcess
getMaxIterations() - Method in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer: Returns the maximum number of iterations that this instance will use.
getMaxIterations() - Method in class edu.uci.ics.jung.algorithms.util.KMeansClusterer
getMessage() - Method in exception edu.uci.ics.jung.algorithms.util.KMeansClusterer.NotEnoughClustersException
getMinCutEdges() - Method in class edu.uci.ics.jung.algorithms.flows.EdmondsKarpMaxFlow
getNextVertex() - Method in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance.SourceData
getNextVertex() - Method in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraShortestPath.SourcePathData
getNodesInSinkPartition() - Method in class edu.uci.ics.jung.algorithms.flows.EdmondsKarpMaxFlow
getNodesInSourcePartition() - Method in class edu.uci.ics.jung.algorithms.flows.EdmondsKarpMaxFlow
getObjectCounts(Collection<Set<V>>, V) - Method in class edu.uci.ics.jung.algorithms.cluster.VoltageClusterer
getOutputValue(V) - Method in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer: Gets the output value for this vertex.
getPath(V, V) - Method in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraShortestPath: Returns a List of the edges on the shortest path from source to target, in order of their occurrence on this path.
getPath(Graph<V, E>, ShortestPath<V, E>, V, V) - Static method in class edu.uci.ics.jung.algorithms.shortestpath.ShortestPathUtils: Returns a List of the edges on the shortest path from source to target, in order of their occurrence on this path.
getPolarLocations() - Method in class edu.uci.ics.jung.algorithms.layout.RadialTreeLayout
getPrecision() - Method in class edu.uci.ics.jung.algorithms.util.IterativeProcess
getPredecessors(V) - Method in class edu.uci.ics.jung.algorithms.shortestpath.BFSDistanceLabeler: Returns set of predecessors of the given vertex
getPriorRankScore(V) - Method in class edu.uci.ics.jung.algorithms.importance.RelativeAuthorityRanker: Retrieves the value of the prior rank score.
getPriors() - Method in class edu.uci.ics.jung.algorithms.importance.RelativeAuthorityRanker: Retrieves the set of priors.
getRadii() - Method in class edu.uci.ics.jung.algorithms.layout.BalloonLayout
getRadius() - Method in class edu.uci.ics.jung.algorithms.layout.CircleLayout
getRadius() - Method in class edu.uci.ics.jung.algorithms.layout.PolarPoint
getRanked() - Method in class edu.uci.ics.jung.algorithms.importance.Ranking
getRankings() - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker: Retrieves the list of ranking instances in descending sorted order by rank score If the algorithm is ranking edges, the instances will be of type EdgeRanking, otherwise if the algorithm is ranking nodes the instances will be of type NodeRanking
getRankScoreKey() - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker: The user datum key used to store the rank score.
getRankScoreKey() - Method in class edu.uci.ics.jung.algorithms.importance.BetweennessCentrality: the user datum key used to store the rank scores
getRankScoreKey() - Method in class edu.uci.ics.jung.algorithms.importance.KStepMarkov: The user datum key used to store the rank scores.
getRankScoreKey() - Method in class edu.uci.ics.jung.algorithms.importance.WeightedNIPaths: Given a node, returns the corresponding rank score.
getRankScores(int) - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker: Return a list of the top k rank scores.
getRepulsionRange() - Method in class edu.uci.ics.jung.algorithms.layout.SpringLayout
getRow(int) - Method in class edu.uci.ics.jung.algorithms.generators.Lattice2DGenerator
getSeedCandidates(Collection<Set<V>>) - Method in class edu.uci.ics.jung.algorithms.cluster.VoltageClusterer: Returns a list of cluster seeds, ranked in decreasing order of number of appearances in the specified collection of candidate clusters.
getSetToCollapsedVertexTransformer() - Method in class edu.uci.ics.jung.algorithms.transformation.VertexPartitionCollapser
getSize() - Method in class edu.uci.ics.jung.algorithms.layout.AbstractLayout: Returns the current size of the visualization space, accoring to the last call to resize().
getSize() - Method in class edu.uci.ics.jung.algorithms.layout.AggregateLayout
getSize() - Method in interface edu.uci.ics.jung.algorithms.layout.Layout
getSize() - Method in class edu.uci.ics.jung.algorithms.layout.LayoutDecorator
getSize() - Method in class edu.uci.ics.jung.algorithms.layout.TreeLayout
getSleepTime() - Method in class edu.uci.ics.jung.algorithms.layout.util.VisRunner
getSourceData(V) - Method in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance
getSourceData(V) - Method in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraShortestPath
getStatus() - Method in class edu.uci.ics.jung.algorithms.layout.ISOMLayout
getStatus() - Method in class edu.uci.ics.jung.algorithms.layout.KKLayout
getStretch() - Method in class edu.uci.ics.jung.algorithms.layout.SpringLayout
getTheta() - Method in class edu.uci.ics.jung.algorithms.layout.PolarPoint
getTolerance() - Method in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer: Gets the size of the largest change (difference between the current and previous values) for any vertex that can be tolerated.
getUniformRootPrior(Collection<V>) - Static method in class edu.uci.ics.jung.algorithms.scoring.util.ScoringUtils: Assigns a probability of 1/roots.size() to each of the elements of roots.
getUnvisitedVertices() - Method in class edu.uci.ics.jung.algorithms.shortestpath.BFSDistanceLabeler: Returns the set of all vertices that were not visited
getV() - Method in class edu.uci.ics.jung.algorithms.scoring.util.VEPair
getValue() - Method in class edu.uci.ics.jung.algorithms.util.BasicMapEntry
getVertex(int, int) - Method in class edu.uci.ics.jung.algorithms.generators.Lattice2DGenerator
getVertex(int) - Method in class edu.uci.ics.jung.algorithms.generators.Lattice2DGenerator
getVertex(Layout<V, E>, double, double) - Method in interface edu.uci.ics.jung.algorithms.layout.GraphElementAccessor: Returns the vertex, if any, associated with (x, y).
getVertex(Layout<V, E>, double, double) - Method in class edu.uci.ics.jung.algorithms.layout.RadiusGraphElementAccessor: Gets the vertex nearest to the location of the (x,y) location selected, within a distance of maxDistance.
getVertex(Layout<V, E>, double, double, double) - Method in class edu.uci.ics.jung.algorithms.layout.RadiusGraphElementAccessor: Gets the vertex nearest to the location of the (x,y) location selected, within a distance of maxDistance.
getVertexCount() - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker
getVertexPartitions() - Method in class edu.uci.ics.jung.algorithms.blockmodel.VertexPartition: Returns a collection of vertex sets, where each vertex in the input graph is in exactly one set.
getVertexPrior(V) - Method in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorerWithPriors: Returns the prior probability for v.
getVertexPriors() - Method in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorerWithPriors: Returns a Function which maps each vertex to its prior probability.
getVertexRankScore(V) - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker: Given a node, returns the corresponding rank score.
getVertexRankScore(V, Object) - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker
getVertexRankScores() - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker
getVertexRankScores(Object) - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker
getVertexScore(V) - Method in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer
getVertexScore(V) - Method in class edu.uci.ics.jung.algorithms.scoring.BetweennessCentrality
getVertexScore(V) - Method in class edu.uci.ics.jung.algorithms.scoring.DegreeScorer: Returns the degree of the vertex.
getVertexScore(V) - Method in class edu.uci.ics.jung.algorithms.scoring.DistanceCentralityScorer: Calculates the score for the specified vertex.
getVertexScore(V) - Method in interface edu.uci.ics.jung.algorithms.scoring.VertexScorer
getVertexToPartitionMap() - Method in class edu.uci.ics.jung.algorithms.blockmodel.VertexPartition: Returns a map from each vertex in the input graph to its partition.
getVertices() - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker
getVertices(Layout<V, E>, Shape) - Method in interface edu.uci.ics.jung.algorithms.layout.GraphElementAccessor
getVertices(Layout<V, E>, Shape) - Method in class edu.uci.ics.jung.algorithms.layout.RadiusGraphElementAccessor
getVerticesInOrderVisited() - Method in class edu.uci.ics.jung.algorithms.shortestpath.BFSDistanceLabeler: Returns the list of vertices visited in order of traversal
getX(V) - Method in class edu.uci.ics.jung.algorithms.layout.AbstractLayout: Returns the x coordinate of the vertex from the Coordinates object.
getY(V) - Method in class edu.uci.ics.jung.algorithms.layout.AbstractLayout: Returns the y coordinate of the vertex from the Coordinates object.
graph - Variable in class edu.uci.ics.jung.algorithms.layout.AbstractLayout
graph - Variable in class edu.uci.ics.jung.algorithms.layout.TreeLayout
graph - Variable in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer: The graph on which the calculations are to be made.
graph - Variable in class edu.uci.ics.jung.algorithms.scoring.BetweennessCentrality
graph - Variable in class edu.uci.ics.jung.algorithms.scoring.DegreeScorer: The graph for which scores are to be generated.
graph - Variable in class edu.uci.ics.jung.algorithms.scoring.DistanceCentralityScorer: The graph on which the vertex scores are to be calculated.
graph - Variable in class edu.uci.ics.jung.algorithms.scoring.util.UniformInOut: The graph for which the edge weights are defined.
graph - Variable in class edu.uci.ics.jung.algorithms.shortestpath.MinimumSpanningForest
graph - Variable in class edu.uci.ics.jung.algorithms.shortestpath.MinimumSpanningForest2
graph_factory - Variable in class edu.uci.ics.jung.algorithms.generators.Lattice2DGenerator
graph_factory - Variable in class edu.uci.ics.jung.algorithms.transformation.VertexPartitionCollapser
GraphElementAccessor<V,E> - Interface in edu.uci.ics.jung.algorithms.layout: Interface for coordinate-based selection of graph components.
graphFactory - Variable in class edu.uci.ics.jung.algorithms.generators.random.BarabasiAlbertGenerator
GraphGenerator<V,E> - Interface in edu.uci.ics.jung.algorithms.generators: An interface for algorithms that generate graphs.

H

hasAugmentingPath() - Method in class edu.uci.ics.jung.algorithms.flows.EdmondsKarpMaxFlow
hasConverged() - Method in class edu.uci.ics.jung.algorithms.util.IterativeProcess: Check to see if the result has been attained.
hashCode() - Method in class edu.uci.ics.jung.algorithms.util.BasicMapEntry
hierarchy(V) - Method in class edu.uci.ics.jung.algorithms.metrics.StructuralHoles: Calculates the hierarchy value for a given vertex.
high - Variable in class edu.uci.ics.jung.algorithms.cluster.BicomponentClusterer
HITS<V,E> - Class in edu.uci.ics.jung.algorithms.scoring: Assigns hub and authority scores to each vertex depending on the topology of the network.
HITS(Graph<V, E>, Function<E, Double>, double) - Constructor for class edu.uci.ics.jung.algorithms.scoring.HITS: Creates an instance for the specified graph, edge weights, and alpha (random jump probability) parameter.
HITS(Graph<V, E>, double) - Constructor for class edu.uci.ics.jung.algorithms.scoring.HITS: Creates an instance for the specified graph and alpha (random jump probability) parameter.
HITS(Graph<V, E>) - Constructor for class edu.uci.ics.jung.algorithms.scoring.HITS: Creates an instance for the specified graph.
HITS.Scores - Class in edu.uci.ics.jung.algorithms.scoring: Maintains hub and authority score information for a vertex.
HITSWithPriors<V,E> - Class in edu.uci.ics.jung.algorithms.scoring: A generalization of HITS that permits non-uniformly-distributed random jumps.
HITSWithPriors(Hypergraph<V, E>, Function<E, ? extends Number>, Function<V, HITS.Scores>, double) - Constructor for class edu.uci.ics.jung.algorithms.scoring.HITSWithPriors: Creates an instance for the specified graph, edge weights, vertex prior probabilities, and random jump probability (alpha).
HITSWithPriors(Hypergraph<V, E>, Function<V, HITS.Scores>, double) - Constructor for class edu.uci.ics.jung.algorithms.scoring.HITSWithPriors: Creates an instance for the specified graph, vertex priors, and random jump probability (alpha).
hub - Variable in class edu.uci.ics.jung.algorithms.scoring.HITS.Scores: The hub score for a vertex.
hyperedges_are_self_loops - Variable in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer

I

ignore_missing - Variable in class edu.uci.ics.jung.algorithms.scoring.DistanceCentralityScorer: Specifies whether, for a vertex v with missing (null) distances, v's score should ignore the missing values or be set to 'null'.
ignore_self_distances - Variable in class edu.uci.ics.jung.algorithms.scoring.DistanceCentralityScorer: Specifies whether the values returned should ignore self-distances (distances from v to itself).
incomingEdges - Variable in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraShortestPath.SourcePathData
incrementRankScore(V, double) - Method in class edu.uci.ics.jung.algorithms.importance.KStepMarkov
incrementRankScore(V, double) - Method in class edu.uci.ics.jung.algorithms.importance.WeightedNIPaths
index_vertex - Variable in class edu.uci.ics.jung.algorithms.generators.random.BarabasiAlbertGenerator
Indexer - Class in edu.uci.ics.jung.algorithms.util: A class providing static methods useful for improving the performance of graph algorithms.
Indexer() - Constructor for class edu.uci.ics.jung.algorithms.util.Indexer
init_vertices - Variable in class edu.uci.ics.jung.algorithms.generators.random.BarabasiAlbertGenerator
initialize(Graph<V, E>, boolean, boolean) - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker
initialize() - Method in class edu.uci.ics.jung.algorithms.layout.AggregateLayout
initialize() - Method in class edu.uci.ics.jung.algorithms.layout.CircleLayout
initialize() - Method in class edu.uci.ics.jung.algorithms.layout.DAGLayout: Had to override this one as well, to ensure that setRoot() is called.
initialize() - Method in class edu.uci.ics.jung.algorithms.layout.FRLayout
initialize() - Method in class edu.uci.ics.jung.algorithms.layout.FRLayout2
initialize() - Method in class edu.uci.ics.jung.algorithms.layout.ISOMLayout
initialize() - Method in class edu.uci.ics.jung.algorithms.layout.KKLayout
initialize() - Method in interface edu.uci.ics.jung.algorithms.layout.Layout: Initializes fields in the node that may not have been set during the constructor.
initialize() - Method in class edu.uci.ics.jung.algorithms.layout.LayoutDecorator
initialize() - Method in class edu.uci.ics.jung.algorithms.layout.SpringLayout
initialize() - Method in class edu.uci.ics.jung.algorithms.layout.StaticLayout
initialize() - Method in class edu.uci.ics.jung.algorithms.layout.TreeLayout
initialize() - Method in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer: Initializes the internal state for this instance.
initialize() - Method in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorerWithPriors: Initializes the state of this instance.
initialize(Graph<V, E>) - Method in class edu.uci.ics.jung.algorithms.scoring.BetweennessCentrality
initialize() - Method in class edu.uci.ics.jung.algorithms.scoring.VoltageScorer: Initializes the state of this instance.
initialize(Hypergraph<V, E>, Set<V>) - Method in class edu.uci.ics.jung.algorithms.shortestpath.BFSDistanceLabeler
initialized - Variable in class edu.uci.ics.jung.algorithms.layout.AbstractLayout
initializeGraph() - Method in class edu.uci.ics.jung.algorithms.generators.random.EppsteinPowerLawGenerator
initializeIterations() - Method in class edu.uci.ics.jung.algorithms.flows.EdmondsKarpMaxFlow
initializeIterations() - Method in class edu.uci.ics.jung.algorithms.util.IterativeProcess: Initializes internal parameters to start the iterative process.
initializeRankings() - Method in class edu.uci.ics.jung.algorithms.importance.KStepMarkov
is_directed - Variable in class edu.uci.ics.jung.algorithms.generators.Lattice2DGenerator
is_toroidal - Variable in class edu.uci.ics.jung.algorithms.generators.Lattice2DGenerator
isDisconnectedGraphOK() - Method in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer: Returns true if this instance accepts vertices with no outgoing edges, and false otherwise.
isEmpty() - Method in class edu.uci.ics.jung.algorithms.util.MapBinaryHeap: Returns true if this collection contains no elements, and false otherwise.
isIncremental() - Method in class edu.uci.ics.jung.algorithms.layout.FRLayout
isIncremental() - Method in class edu.uci.ics.jung.algorithms.layout.FRLayout2
isIncremental() - Method in class edu.uci.ics.jung.algorithms.layout.ISOMLayout: This one is an incremental visualization.
isIncremental() - Method in class edu.uci.ics.jung.algorithms.layout.KKLayout
isIncremental() - Method in class edu.uci.ics.jung.algorithms.layout.SpringLayout
isLocked(V) - Method in class edu.uci.ics.jung.algorithms.layout.AbstractLayout
isLocked(V) - Method in class edu.uci.ics.jung.algorithms.layout.AggregateLayout
isLocked(V) - Method in interface edu.uci.ics.jung.algorithms.layout.Layout
isLocked(V) - Method in class edu.uci.ics.jung.algorithms.layout.LayoutDecorator
isLocked(V) - Method in class edu.uci.ics.jung.algorithms.layout.TreeLayout
ISOMLayout<V,E> - Class in edu.uci.ics.jung.algorithms.layout: Implements a self-organizing map layout algorithm, based on Meyer's self-organizing graph methods.
ISOMLayout(Graph<V, E>) - Constructor for class edu.uci.ics.jung.algorithms.layout.ISOMLayout
ISOMLayout.ISOMVertexData - Class in edu.uci.ics.jung.algorithms.layout
isomVertexData - Variable in class edu.uci.ics.jung.algorithms.layout.ISOMLayout
ISOMVertexData() - Constructor for class edu.uci.ics.jung.algorithms.layout.ISOMLayout.ISOMVertexData
isRankingEdges() - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker
isRankingNodes() - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker
isStructurallyEquivalent(Graph<V, ?>, V, V) - Method in class edu.uci.ics.jung.algorithms.blockmodel.StructurallyEquivalent
IterativeContext - Interface in edu.uci.ics.jung.algorithms.util: An interface for algorithms that proceed iteratively.
IterativeProcess - Class in edu.uci.ics.jung.algorithms.util: Provides basic infrastructure for iterative algorithms.
IterativeProcess() - Constructor for class edu.uci.ics.jung.algorithms.util.IterativeProcess: Generic constructor.
iterator() - Method in class edu.uci.ics.jung.algorithms.util.MapBinaryHeap: Returns an Iterator that does not support modification of the heap.

K

KKLayout<V,E> - Class in edu.uci.ics.jung.algorithms.layout: Implements the Kamada-Kawai algorithm for node layout.
KKLayout(Graph<V, E>) - Constructor for class edu.uci.ics.jung.algorithms.layout.KKLayout
KKLayout(Graph<V, E>, Distance<V>) - Constructor for class edu.uci.ics.jung.algorithms.layout.KKLayout: Creates an instance for the specified graph and distance metric.
KleinbergSmallWorldGenerator<V,E> - Class in edu.uci.ics.jung.algorithms.generators.random: Graph generator that produces a random graph with small world properties.
KleinbergSmallWorldGenerator(Supplier<? extends Graph<V, E>>, Supplier<V>, Supplier<E>, int, double) - Constructor for class edu.uci.ics.jung.algorithms.generators.random.KleinbergSmallWorldGenerator: Creates an instance with the specified parameters, whose underlying lattice is (a) of size latticeSize x latticeSize, and (b) toroidal.
KleinbergSmallWorldGenerator(Supplier<? extends Graph<V, E>>, Supplier<V>, Supplier<E>, int, int, double) - Constructor for class edu.uci.ics.jung.algorithms.generators.random.KleinbergSmallWorldGenerator: Creates an instance with the specified parameters, whose underlying lattice is toroidal.
KleinbergSmallWorldGenerator(Supplier<? extends Graph<V, E>>, Supplier<V>, Supplier<E>, int, int, double, boolean) - Constructor for class edu.uci.ics.jung.algorithms.generators.random.KleinbergSmallWorldGenerator: Creates an instance with the specified parameters.
kmc - Variable in class edu.uci.ics.jung.algorithms.cluster.VoltageClusterer
KMeansClusterer<T> - Class in edu.uci.ics.jung.algorithms.util: Groups items into a specified number of clusters, based on their proximity in d-dimensional space, using the k-means algorithm.
KMeansClusterer(int, double) - Constructor for class edu.uci.ics.jung.algorithms.util.KMeansClusterer: Creates an instance which will terminate when either the maximum number of iterations has been reached, or all changes are smaller than the convergence threshold.
KMeansClusterer() - Constructor for class edu.uci.ics.jung.algorithms.util.KMeansClusterer: Creates an instance with max iterations of 100 and convergence threshold of 0.001.
KMeansClusterer.NotEnoughClustersException - Exception in edu.uci.ics.jung.algorithms.util: An exception that indicates that the specified data points cannot be clustered into the number of clusters requested by the user.
KNeighborhoodFilter<V,E> - Class in edu.uci.ics.jung.algorithms.filters: A filter used to extract the k-neighborhood around one or more root node(s).
KNeighborhoodFilter(Set<V>, int, KNeighborhoodFilter.EdgeType) - Constructor for class edu.uci.ics.jung.algorithms.filters.KNeighborhoodFilter: Constructs a new instance of the filter.
KNeighborhoodFilter(V, int, KNeighborhoodFilter.EdgeType) - Constructor for class edu.uci.ics.jung.algorithms.filters.KNeighborhoodFilter: Constructs a new instance of the filter.
KNeighborhoodFilter.EdgeType - Enum in edu.uci.ics.jung.algorithms.filters: The type of edge to follow for defining the neighborhood.
KStepMarkov<V,E> - Class in edu.uci.ics.jung.algorithms.importance: Algorithm variant of PageRankWithPriors that computes the importance of a node based upon taking fixed-length random walks out from the root set and then computing the stationary probability of being at each node.
KStepMarkov(DirectedGraph<V, E>, Set<V>, int, Map<E, Number>) - Constructor for class edu.uci.ics.jung.algorithms.importance.KStepMarkov: Construct the algorihm instance and initializes the algorithm.
KStepMarkov<V,E> - Class in edu.uci.ics.jung.algorithms.scoring: A special case of PageRankWithPriors in which the final scores represent a probability distribution over position assuming a random (Markovian) walk of exactly k steps, based on the initial distribution specified by the priors.
KStepMarkov(Hypergraph<V, E>, Function<E, ? extends Number>, Function<V, Double>, int) - Constructor for class edu.uci.ics.jung.algorithms.scoring.KStepMarkov: Creates an instance based on the specified graph, edge weights, vertex priors (initial scores), and number of steps to take.
KStepMarkov(Hypergraph<V, E>, Function<V, Double>, int) - Constructor for class edu.uci.ics.jung.algorithms.scoring.KStepMarkov: Creates an instance based on the specified graph, vertex priors (initial scores), and number of steps to take.
KStepMarkov(Hypergraph<V, E>, int) - Constructor for class edu.uci.ics.jung.algorithms.scoring.KStepMarkov: Creates an instance based on the specified graph and number of steps to take.
KullbackLeibler(double[], double[]) - Static method in class edu.uci.ics.jung.algorithms.util.DiscreteDistribution: Returns the Kullback-Leibler divergence between the two specified distributions, which must have the same number of elements.

L

labelDistances(Hypergraph<V, E>, Set<V>) - Method in class edu.uci.ics.jung.algorithms.shortestpath.BFSDistanceLabeler: Computes the distances of all the node from the starting root nodes.
labelDistances(Hypergraph<V, E>, V) - Method in class edu.uci.ics.jung.algorithms.shortestpath.BFSDistanceLabeler: Computes the distances of all the node from the specified root node.
Lattice2DGenerator<V,E> - Class in edu.uci.ics.jung.algorithms.generators: Simple generator of an m x n lattice where each vertex is incident with each of its neighbors (to the left, right, up, and down).
Lattice2DGenerator(Supplier<? extends Graph<V, E>>, Supplier<V>, Supplier<E>, int, boolean) - Constructor for class edu.uci.ics.jung.algorithms.generators.Lattice2DGenerator: Constructs a generator of square lattices of size latticeSize with the specified parameters.
Lattice2DGenerator(Supplier<? extends Graph<V, E>>, Supplier<V>, Supplier<E>, int, int, boolean) - Constructor for class edu.uci.ics.jung.algorithms.generators.Lattice2DGenerator: Creates a generator of row_count x col_count lattices with the specified parameters.
Layout<V,E> - Interface in edu.uci.ics.jung.algorithms.layout: A generalized interface is a mechanism for returning (x,y) coordinates from vertices.
LayoutDecorator<V,E> - Class in edu.uci.ics.jung.algorithms.layout: a pure decorator for the Layout interface.
LayoutDecorator(Layout<V, E>) - Constructor for class edu.uci.ics.jung.algorithms.layout.LayoutDecorator: Creates an instance backed by the specified delegate.
layouts - Variable in class edu.uci.ics.jung.algorithms.layout.AggregateLayout
lengthFunction - Variable in class edu.uci.ics.jung.algorithms.layout.SpringLayout
link(Graph<V, E>, V, V) - Static method in class edu.uci.ics.jung.algorithms.metrics.TriadicCensus
localConstraint(V, V) - Method in class edu.uci.ics.jung.algorithms.metrics.StructuralHoles: Returns the local constraint on v1 from a lack of primary holes around its neighbor v2.
locations - Variable in class edu.uci.ics.jung.algorithms.layout.AbstractLayout
locations - Variable in class edu.uci.ics.jung.algorithms.layout.TreeLayout
lock(V, boolean) - Method in class edu.uci.ics.jung.algorithms.layout.AbstractLayout: Locks v in place if state is true, otherwise unlocks it.
lock(boolean) - Method in class edu.uci.ics.jung.algorithms.layout.AbstractLayout
lock(V, boolean) - Method in class edu.uci.ics.jung.algorithms.layout.AggregateLayout: Locks this vertex in the main layout and in any sublayouts whose graph contains this vertex.
lock(V, boolean) - Method in interface edu.uci.ics.jung.algorithms.layout.Layout: Locks or unlocks the specified vertex.
lock(V, boolean) - Method in class edu.uci.ics.jung.algorithms.layout.LayoutDecorator
lock(V, boolean) - Method in class edu.uci.ics.jung.algorithms.layout.TreeLayout
loopCountMax - Variable in class edu.uci.ics.jung.algorithms.layout.SpringLayout2

M

m_currentPoint - Variable in class edu.uci.ics.jung.algorithms.layout.TreeLayout
manualSuspend - Variable in class edu.uci.ics.jung.algorithms.layout.util.VisRunner
map - Variable in class edu.uci.ics.jung.algorithms.util.MapSettableTransformer
MapBinaryHeap<T> - Class in edu.uci.ics.jung.algorithms.util: An array-based binary heap implementation of a priority queue, which also provides efficient update() and contains operations.
MapBinaryHeap(Comparator<T>) - Constructor for class edu.uci.ics.jung.algorithms.util.MapBinaryHeap: Creates a MapBinaryHeap whose heap ordering is based on the ordering of the elements specified by comp.
MapBinaryHeap() - Constructor for class edu.uci.ics.jung.algorithms.util.MapBinaryHeap: Creates a MapBinaryHeap whose heap ordering will be based on the natural ordering of the elements, which must be Comparable.
MapBinaryHeap(Collection<T>) - Constructor for class edu.uci.ics.jung.algorithms.util.MapBinaryHeap: Creates a MapBinaryHeap based on the specified collection whose heap ordering will be based on the natural ordering of the elements, which must be Comparable.
MapBinaryHeap(Collection<T>, Comparator<T>) - Constructor for class edu.uci.ics.jung.algorithms.util.MapBinaryHeap: Creates a MapBinaryHeap based on the specified collection whose heap ordering is based on the ordering of the elements specified by c.
MapSettableTransformer<I,O> - Class in edu.uci.ics.jung.algorithms.util: A SettableTransformer that operates on an underlying Map instance.
MapSettableTransformer(Map<I, O>) - Constructor for class edu.uci.ics.jung.algorithms.util.MapSettableTransformer: Creates an instance based on m.
MapValueArrayComparator(Map<V, double[]>) - Constructor for class edu.uci.ics.jung.algorithms.cluster.VoltageClusterer.MapValueArrayComparator
max_delta - Variable in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer: The largest change seen so far among all vertex scores.
max_distance - Variable in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance
max_iterations - Variable in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer: Maximum number of iterations to use before terminating.
max_iterations - Variable in class edu.uci.ics.jung.algorithms.util.KMeansClusterer
max_targets - Variable in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance
MAX_TRIADS - Static variable in class edu.uci.ics.jung.algorithms.metrics.TriadicCensus
maxDistance - Variable in class edu.uci.ics.jung.algorithms.layout.RadiusGraphElementAccessor
maxScaledMutualEdgeWeight(V, V) - Method in class edu.uci.ics.jung.algorithms.metrics.StructuralHoles: The marginal strength of v1's relation with contact v2.
mean(Collection<double[]>) - Static method in class edu.uci.ics.jung.algorithms.util.DiscreteDistribution: Returns the mean of the specified Collection of distributions, which are assumed to be normalized arrays of double values.
mean(double[][]) - Static method in class edu.uci.ics.jung.algorithms.util.DiscreteDistribution: Returns the mean of the specified array of distributions, represented as normalized arrays of double values.
Metrics - Class in edu.uci.ics.jung.algorithms.metrics: A class consisting of static methods for calculating graph metrics.
Metrics() - Constructor for class edu.uci.ics.jung.algorithms.metrics.Metrics
MinimumSpanningForest<V,E> - Class in edu.uci.ics.jung.algorithms.shortestpath: For the input Graph, creates a MinimumSpanningTree using a variation of Prim's algorithm.
MinimumSpanningForest(Graph<V, E>, Supplier<Forest<V, E>>, V, Map<E, Double>) - Constructor for class edu.uci.ics.jung.algorithms.shortestpath.MinimumSpanningForest: Creates a Forest from the supplied Graph and supplied Supplier, which is used to create a new, empty Forest.
MinimumSpanningForest(Graph<V, E>, Forest<V, E>, V, Map<E, Double>) - Constructor for class edu.uci.ics.jung.algorithms.shortestpath.MinimumSpanningForest: Creates a minimum spanning forest from the supplied graph, populating the supplied Forest, which must be empty.
MinimumSpanningForest(Graph<V, E>, Forest<V, E>, V) - Constructor for class edu.uci.ics.jung.algorithms.shortestpath.MinimumSpanningForest: Creates a minimum spanning forest from the supplied graph, populating the supplied Forest, which must be empty.
MinimumSpanningForest2<V,E> - Class in edu.uci.ics.jung.algorithms.shortestpath: For the input Graph, creates a MinimumSpanningTree using a variation of Prim's algorithm.
MinimumSpanningForest2(Graph<V, E>, Supplier<Forest<V, E>>, Supplier<? extends Graph<V, E>>, Function<? super E, Double>) - Constructor for class edu.uci.ics.jung.algorithms.shortestpath.MinimumSpanningForest2: Create a Forest from the supplied Graph and supplied Supplier, which is used to create a new, empty Forest.
MinimumSpanningForest2(Graph<V, E>, Forest<V, E>, Supplier<? extends Graph<V, E>>, Function<? super E, Double>) - Constructor for class edu.uci.ics.jung.algorithms.shortestpath.MinimumSpanningForest2: Create a forest from the supplied graph, populating the supplied Forest, which must be empty.
MixedRandomGraphGenerator - Class in edu.uci.ics.jung.algorithms.generators.random: Generates a mixed-mode random graph (with random edge weights) based on the output of BarabasiAlbertGenerator.
MixedRandomGraphGenerator() - Constructor for class edu.uci.ics.jung.algorithms.generators.random.MixedRandomGraphGenerator
mod(int, int) - Method in class edu.uci.ics.jung.algorithms.generators.Lattice2DGenerator
moveNodes() - Method in class edu.uci.ics.jung.algorithms.layout.DAGLayout: Override the moveNodes() method from SpringLayout.
moveNodes() - Method in class edu.uci.ics.jung.algorithms.layout.SpringLayout
moveNodes() - Method in class edu.uci.ics.jung.algorithms.layout.SpringLayout2
mutualWeight(V, V) - Method in class edu.uci.ics.jung.algorithms.metrics.StructuralHoles: Returns the weight of the edge from v1 to v2 plus the weight of the edge from v2 to v1; if either edge does not exist, it is treated as an edge with weight 0.

N

nev - Variable in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance
nextItem() - Method in class edu.uci.ics.jung.algorithms.util.WeightedChoice: Retrieves an item with probability proportional to its weight in the Map provided in the input.
norm() - Method in class edu.uci.ics.jung.algorithms.layout.FRLayout.FRVertexData
normalize(double[], double) - Static method in class edu.uci.ics.jung.algorithms.util.DiscreteDistribution: Normalizes, with Lagrangian smoothing, the specified double array, so that the values sum to 1 (i.e., can be treated as probabilities).
normalizedMutualEdgeWeight(V, V) - Method in class edu.uci.ics.jung.algorithms.metrics.StructuralHoles: Returns the proportion of v1's network time and energy invested in the relationship with v2.
normalizeEdgeTransitionWeights() - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker
normalizeRankings() - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker
normalizeScores() - Method in class edu.uci.ics.jung.algorithms.scoring.HITSWithPriors: Normalizes scores so that sum of their squares = 1.
NotEnoughClustersException() - Constructor for exception edu.uci.ics.jung.algorithms.util.KMeansClusterer.NotEnoughClustersException
num_candidates - Variable in class edu.uci.ics.jung.algorithms.cluster.VoltageClusterer
numIterations() - Method in interface edu.uci.ics.jung.algorithms.generators.EvolvingGraphGenerator: Retrieves the total number of steps elapsed.
numIterations() - Method in class edu.uci.ics.jung.algorithms.generators.random.BarabasiAlbertGenerator
numPartitions() - Method in class edu.uci.ics.jung.algorithms.blockmodel.VertexPartition

O

offer(T) - Method in class edu.uci.ics.jung.algorithms.util.MapBinaryHeap
offset(double, double) - Method in class edu.uci.ics.jung.algorithms.layout.FRLayout.FRVertexData
offsetVertex(V, double, double) - Method in class edu.uci.ics.jung.algorithms.layout.AbstractLayout
onFinalize(Object) - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker
onFinalize(Object) - Method in class edu.uci.ics.jung.algorithms.importance.WeightedNIPaths
organizationalMeasure(Graph<V, E>, V) - Method in class edu.uci.ics.jung.algorithms.metrics.StructuralHoles: A measure of the organization of individuals within the subgraph centered on v.
originalPos - Variable in class edu.uci.ics.jung.algorithms.importance.Ranking: The original (0-indexed) position of the instance being ranked
output - Variable in class edu.uci.ics.jung.algorithms.scoring.DistanceCentralityScorer: The cache for the output results.
output_reversed - Variable in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer: Indicates whether the output and current values are in a 'swapped' state.

P

PageRank<V,E> - Class in edu.uci.ics.jung.algorithms.scoring: Assigns scores to each vertex according to the PageRank algorithm.
PageRank(Hypergraph<V, E>, Function<E, ? extends Number>, double) - Constructor for class edu.uci.ics.jung.algorithms.scoring.PageRank: Creates an instance for the specified graph, edge weights, and random jump probability.
PageRank(Hypergraph<V, E>, double) - Constructor for class edu.uci.ics.jung.algorithms.scoring.PageRank: Creates an instance for the specified graph and random jump probability; the probability of following any outgoing edge from a given vertex is the same.
PageRankWithPriors<V,E> - Class in edu.uci.ics.jung.algorithms.scoring: A generalization of PageRank that permits non-uniformly-distributed random jumps.
PageRankWithPriors(Hypergraph<V, E>, Function<E, ? extends Number>, Function<V, Double>, double) - Constructor for class edu.uci.ics.jung.algorithms.scoring.PageRankWithPriors: Creates an instance with the specified graph, edge weights, vertex priors, and 'random jump' probability (alpha).
PageRankWithPriors(Hypergraph<V, E>, Function<V, Double>, double) - Constructor for class edu.uci.ics.jung.algorithms.scoring.PageRankWithPriors: Creates an instance with the specified graph, vertex priors, and 'random jump' probability (alpha).
parents - Variable in class edu.uci.ics.jung.algorithms.cluster.BicomponentClusterer
pause() - Method in interface edu.uci.ics.jung.algorithms.layout.util.Relaxer: Make the relaxer thread wait.
pause() - Method in class edu.uci.ics.jung.algorithms.layout.util.VisRunner
pauseObject - Variable in class edu.uci.ics.jung.algorithms.layout.util.VisRunner: Used for synchronization.
peek() - Method in class edu.uci.ics.jung.algorithms.util.MapBinaryHeap: Returns the element at the top of the heap; does not alter the heap.
polarLocations - Variable in class edu.uci.ics.jung.algorithms.layout.BalloonLayout
polarLocations - Variable in class edu.uci.ics.jung.algorithms.layout.RadialTreeLayout
PolarPoint - Class in edu.uci.ics.jung.algorithms.layout: Represents a point in polar coordinates: distance and angle from the origin.
PolarPoint() - Constructor for class edu.uci.ics.jung.algorithms.layout.PolarPoint: Creates a new instance with radius and angle each 0.
PolarPoint(double, double) - Constructor for class edu.uci.ics.jung.algorithms.layout.PolarPoint: Creates a new instance with the specified radius and angle.
polarToCartesian(PolarPoint) - Static method in class edu.uci.ics.jung.algorithms.layout.PolarPoint
polarToCartesian(double, double) - Static method in class edu.uci.ics.jung.algorithms.layout.PolarPoint
poll() - Method in class edu.uci.ics.jung.algorithms.util.MapBinaryHeap
prerelax() - Method in interface edu.uci.ics.jung.algorithms.layout.util.Relaxer: Execute a loop of steps in the calling thread, firing no events.
prerelax() - Method in class edu.uci.ics.jung.algorithms.layout.util.VisRunner
PrimMinimumSpanningTree<V,E> - Class in edu.uci.ics.jung.algorithms.shortestpath: For the input Graph, creates a MinimumSpanningTree using a variation of Prim's algorithm.
PrimMinimumSpanningTree(Supplier<? extends Graph<V, E>>) - Constructor for class edu.uci.ics.jung.algorithms.shortestpath.PrimMinimumSpanningTree: Creates an instance which generates a minimum spanning tree assuming constant edge weights.
PrimMinimumSpanningTree(Supplier<? extends Graph<V, E>>, Function<? super E, Double>) - Constructor for class edu.uci.ics.jung.algorithms.shortestpath.PrimMinimumSpanningTree: Creates an instance which generates a minimum spanning tree using the input edge weights.
printRankings(boolean, boolean) - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker: Print the rankings to standard out in descending order of rank score
priorRankScoreMap - Variable in class edu.uci.ics.jung.algorithms.importance.RelativeAuthorityRanker: The default key used for the user datum key corresponding to prior rank scores.
process - Variable in class edu.uci.ics.jung.algorithms.layout.util.VisRunner
propagateMinimumLevel(V) - Method in class edu.uci.ics.jung.algorithms.layout.DAGLayout: A recursive method for allocating the level for each vertex.
put(Layout<V, E>, Point2D) - Method in class edu.uci.ics.jung.algorithms.layout.AggregateLayout: Adds the passed layout as a sublayout, and specifies the center of where this sublayout should appear.

R

RadialTreeLayout<V,E> - Class in edu.uci.ics.jung.algorithms.layout: A radial layout for Tree or Forest graphs.
RadialTreeLayout(Forest<V, E>) - Constructor for class edu.uci.ics.jung.algorithms.layout.RadialTreeLayout
RadialTreeLayout(Forest<V, E>, int) - Constructor for class edu.uci.ics.jung.algorithms.layout.RadialTreeLayout
RadialTreeLayout(Forest<V, E>, int, int) - Constructor for class edu.uci.ics.jung.algorithms.layout.RadialTreeLayout
radii - Variable in class edu.uci.ics.jung.algorithms.layout.BalloonLayout
RadiusGraphElementAccessor<V,E> - Class in edu.uci.ics.jung.algorithms.layout: Simple implementation of PickSupport that returns the vertex or edge that is closest to the specified location.
RadiusGraphElementAccessor() - Constructor for class edu.uci.ics.jung.algorithms.layout.RadiusGraphElementAccessor: Creates an instance with an effectively infinite default maximum distance.
RadiusGraphElementAccessor(double) - Constructor for class edu.uci.ics.jung.algorithms.layout.RadiusGraphElementAccessor: Creates an instance with the specified default maximum distance.
rand - Variable in class edu.uci.ics.jung.algorithms.cluster.VoltageClusterer
rand - Variable in class edu.uci.ics.jung.algorithms.util.KMeansClusterer
RandomLocationTransformer<V> - Class in edu.uci.ics.jung.algorithms.layout.util: Provides a random vertex location within the bounds of the Dimension property.
RandomLocationTransformer(Dimension) - Constructor for class edu.uci.ics.jung.algorithms.layout.util.RandomLocationTransformer: Creates an instance with the specified size which uses the current time as the random seed.
RandomLocationTransformer(Dimension, long) - Constructor for class edu.uci.ics.jung.algorithms.layout.util.RandomLocationTransformer: Creates an instance with the specified dimension and random seed.
RANK_SCORE - Static variable in class edu.uci.ics.jung.algorithms.importance.KStepMarkov
Ranking<V> - Class in edu.uci.ics.jung.algorithms.importance: Abstract data container for ranking objects.
Ranking(int, double, V) - Constructor for class edu.uci.ics.jung.algorithms.importance.Ranking: Constructor which allows values to be set on construction
rankScore - Variable in class edu.uci.ics.jung.algorithms.importance.Ranking: The actual rank score (normally between 0 and 1)
reached_max - Variable in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance.SourceData
RelativeAuthorityRanker<V,E> - Class in edu.uci.ics.jung.algorithms.importance: This class provides basic infrastructure for relative authority algorithms that compute the importance of nodes relative to one or more root nodes.
RelativeAuthorityRanker() - Constructor for class edu.uci.ics.jung.algorithms.importance.RelativeAuthorityRanker
relativePrecision(double, double) - Method in class edu.uci.ics.jung.algorithms.util.IterativeProcess
relax() - Method in interface edu.uci.ics.jung.algorithms.layout.util.Relaxer: Execute a loop of steps in a new Thread, firing an event after each step.
relax() - Method in class edu.uci.ics.jung.algorithms.layout.util.VisRunner
relaxEdges() - Method in class edu.uci.ics.jung.algorithms.layout.DAGLayout: Overridden relaxEdges.
relaxEdges() - Method in class edu.uci.ics.jung.algorithms.layout.SpringLayout
Relaxer - Interface in edu.uci.ics.jung.algorithms.layout.util: Interface for operating the relax iterations on a layout.
remove(Layout<V, E>) - Method in class edu.uci.ics.jung.algorithms.layout.AggregateLayout: Removes layout from this instance.
remove(Object) - Method in class edu.uci.ics.jung.algorithms.util.MapBinaryHeap: This data structure does not support the removal of arbitrary elements.
remove() - Method in class edu.uci.ics.jung.algorithms.util.MapBinaryHeap
removeAll() - Method in class edu.uci.ics.jung.algorithms.layout.AggregateLayout: Removes all layouts from this instance.
removeAll(Collection<?>) - Method in class edu.uci.ics.jung.algorithms.util.MapBinaryHeap: This data structure does not support the removal of arbitrary elements.
removeEdgeRankScore(E, Object) - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker
removeEdgeRankScore(E) - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker
removeVertexRankScore(V, Object) - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker
removeVertexRankScore(V) - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker
repulsion_range_sq - Variable in class edu.uci.ics.jung.algorithms.layout.SpringLayout
repulsiondx - Variable in class edu.uci.ics.jung.algorithms.layout.SpringLayout.SpringVertexData
repulsiondy - Variable in class edu.uci.ics.jung.algorithms.layout.SpringLayout.SpringVertexData
reset() - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker
reset() - Method in class edu.uci.ics.jung.algorithms.layout.AggregateLayout
reset() - Method in class edu.uci.ics.jung.algorithms.layout.CircleLayout
reset() - Method in class edu.uci.ics.jung.algorithms.layout.FRLayout
reset() - Method in class edu.uci.ics.jung.algorithms.layout.FRLayout2
reset() - Method in class edu.uci.ics.jung.algorithms.layout.ISOMLayout: Resets the layout iteration count to 0, which allows the layout algorithm to continue updating vertex positions.
reset() - Method in class edu.uci.ics.jung.algorithms.layout.KKLayout
reset() - Method in interface edu.uci.ics.jung.algorithms.layout.Layout
reset() - Method in class edu.uci.ics.jung.algorithms.layout.LayoutDecorator
reset() - Method in class edu.uci.ics.jung.algorithms.layout.SpringLayout: No effect.
reset() - Method in class edu.uci.ics.jung.algorithms.layout.StaticLayout
reset() - Method in class edu.uci.ics.jung.algorithms.layout.TreeLayout
reset() - Method in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance: Clears all stored distances for this instance.
reset(V) - Method in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance: Clears all stored distances for the specified source vertex source.
reset() - Method in class edu.uci.ics.jung.algorithms.shortestpath.UnweightedShortestPath: Clears all stored distances for this instance.
reset(V) - Method in class edu.uci.ics.jung.algorithms.shortestpath.UnweightedShortestPath: Clears all stored distances for the specified source vertex source.
reset() - Method in class edu.uci.ics.jung.algorithms.util.IterativeProcess
restoreVertex(V, double) - Method in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance.SourceData
restoreVertex(V, double) - Method in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraShortestPath.SourcePathData
resume() - Method in interface edu.uci.ics.jung.algorithms.layout.util.Relaxer: Make the relaxer thread resume.
resume() - Method in class edu.uci.ics.jung.algorithms.layout.util.VisRunner
retainAll(Collection<?>) - Method in class edu.uci.ics.jung.algorithms.util.MapBinaryHeap: This data structure does not support the removal of arbitrary elements.
row_count - Variable in class edu.uci.ics.jung.algorithms.generators.Lattice2DGenerator
run() - Method in class edu.uci.ics.jung.algorithms.layout.util.VisRunner
running - Variable in class edu.uci.ics.jung.algorithms.layout.util.VisRunner

S

Scores(double, double) - Constructor for class edu.uci.ics.jung.algorithms.scoring.HITS.Scores: Creates an instance with the specified hub and authority score.
ScoringUtils - Class in edu.uci.ics.jung.algorithms.scoring.util: Methods for assigning values (to be interpreted as prior probabilities) to vertices in the context of random-walk-based scoring algorithms.
ScoringUtils() - Constructor for class edu.uci.ics.jung.algorithms.scoring.util.ScoringUtils
SelfLoopEdgePredicate<V,E> - Class in edu.uci.ics.jung.algorithms.util: A Predicate that returns true if the input edge's endpoints in the input graph are identical.
SelfLoopEdgePredicate() - Constructor for class edu.uci.ics.jung.algorithms.util.SelfLoopEdgePredicate
set(I, O) - Method in class edu.uci.ics.jung.algorithms.util.MapSettableTransformer
set(I, O) - Method in interface edu.uci.ics.jung.algorithms.util.SettableTransformer: Sets the value (output) to be returned by a call to transform(input)).
set_collapsedv - Variable in class edu.uci.ics.jung.algorithms.transformation.VertexPartitionCollapser
setAdjustForGravity(boolean) - Method in class edu.uci.ics.jung.algorithms.layout.KKLayout
setAngle(double) - Method in class edu.uci.ics.jung.algorithms.layout.CircleLayout.CircleVertexData
setAttractionMultiplier(double) - Method in class edu.uci.ics.jung.algorithms.layout.FRLayout
setAttractionMultiplier(double) - Method in class edu.uci.ics.jung.algorithms.layout.FRLayout2
setConnectionCount(int) - Method in class edu.uci.ics.jung.algorithms.generators.random.KleinbergSmallWorldGenerator: Sets the number of new 'small-world' connections (outgoing edges) to be added to each vertex.
setConvergenceThreshold(double) - Method in class edu.uci.ics.jung.algorithms.util.KMeansClusterer
setCumulative(boolean) - Method in class edu.uci.ics.jung.algorithms.scoring.KStepMarkov: Specifies whether this instance should assign a score to each vertex based on the sum over all steps of the probability for each step.
setCurrentPositionFor(V) - Method in class edu.uci.ics.jung.algorithms.layout.RadialTreeLayout
setCurrentPositionFor(V) - Method in class edu.uci.ics.jung.algorithms.layout.TreeLayout
setCurrentRankScore(V, double) - Method in class edu.uci.ics.jung.algorithms.importance.KStepMarkov
setCurrentValue(V, T) - Method in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer: Sets the current value for this vertex.
setDelegate(Layout<V, E>) - Method in class edu.uci.ics.jung.algorithms.layout.AggregateLayout
setDelegate(Layout<V, E>) - Method in class edu.uci.ics.jung.algorithms.layout.LayoutDecorator
setDesiredPrecision(double) - Method in class edu.uci.ics.jung.algorithms.util.IterativeProcess
setDisconnectedDistanceMultiplier(double) - Method in class edu.uci.ics.jung.algorithms.layout.KKLayout
setEdgeRankScore(E, double, Object) - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker
setEdgeRankScore(E, double) - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker
setEdgeWeight(E, double) - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker
setEdgeWeights(Map<E, Number>) - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker
setEdgeWeights(Function<? super E, ? extends Number>) - Method in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer: Sets the Function that this instance uses to associate edge weights with each edge
setExchangeVertices(boolean) - Method in class edu.uci.ics.jung.algorithms.layout.KKLayout: Enable or disable the local minimum escape technique by exchanging vertices.
setForceMultiplier(double) - Method in class edu.uci.ics.jung.algorithms.layout.SpringLayout: Sets the force multiplier for this instance.
setGraph(Graph<V, E>) - Method in class edu.uci.ics.jung.algorithms.layout.AbstractLayout
setGraph(Graph<V, E>) - Method in class edu.uci.ics.jung.algorithms.layout.AggregateLayout
setGraph(Graph<V, E>) - Method in interface edu.uci.ics.jung.algorithms.layout.Layout
setGraph(Graph<V, E>) - Method in class edu.uci.ics.jung.algorithms.layout.LayoutDecorator
setGraph(Graph<V, E>) - Method in class edu.uci.ics.jung.algorithms.layout.TreeLayout
setHyperedgesAreSelfLoops(boolean) - Method in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer: Specifies whether hyperedges are to be treated as self-loops.
setInitializer(Function<V, Point2D>) - Method in class edu.uci.ics.jung.algorithms.layout.AbstractLayout
setInitializer(Function<V, Point2D>) - Method in class edu.uci.ics.jung.algorithms.layout.AggregateLayout
setInitializer(Function<V, Point2D>) - Method in interface edu.uci.ics.jung.algorithms.layout.Layout
setInitializer(Function<V, Point2D>) - Method in class edu.uci.ics.jung.algorithms.layout.LayoutDecorator
setInitializer(Function<V, Point2D>) - Method in class edu.uci.ics.jung.algorithms.layout.TreeLayout
setLengthFactor(double) - Method in class edu.uci.ics.jung.algorithms.layout.KKLayout
setLocation(V, double, double) - Method in class edu.uci.ics.jung.algorithms.layout.AbstractLayout: Forcibly moves a vertex to the (x,y) location by setting its x and y locations to the specified location.
setLocation(V, Point2D) - Method in class edu.uci.ics.jung.algorithms.layout.AbstractLayout
setLocation(V, Point2D) - Method in class edu.uci.ics.jung.algorithms.layout.AggregateLayout
setLocation(V, Point2D) - Method in class edu.uci.ics.jung.algorithms.layout.BalloonLayout
setLocation(V, double, double) - Method in class edu.uci.ics.jung.algorithms.layout.DAGLayout: Override forceMove so that if someone moves a node, we can re-layout everything.
setLocation(V, Point2D) - Method in class edu.uci.ics.jung.algorithms.layout.DAGLayout: Override forceMove so that if someone moves a node, we can re-layout everything.
setLocation(V, Point2D) - Method in interface edu.uci.ics.jung.algorithms.layout.Layout: Changes the layout coordinates of v to location.
setLocation(V, Point2D) - Method in class edu.uci.ics.jung.algorithms.layout.LayoutDecorator
setLocation(PolarPoint) - Method in class edu.uci.ics.jung.algorithms.layout.PolarPoint: Sets the angle and radius of this point to those of p.
setLocation(V, Point2D) - Method in class edu.uci.ics.jung.algorithms.layout.RadialTreeLayout
setLocation(V, Point2D) - Method in class edu.uci.ics.jung.algorithms.layout.TreeLayout
setMaxDistance(double) - Method in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance: Allows the user to specify the maximum distance that this instance will calculate.
setMaximumIterations(int) - Method in class edu.uci.ics.jung.algorithms.util.IterativeProcess
setMaxIterations(int) - Method in class edu.uci.ics.jung.algorithms.layout.FRLayout
setMaxIterations(int) - Method in class edu.uci.ics.jung.algorithms.layout.FRLayout2
setMaxIterations(int) - Method in class edu.uci.ics.jung.algorithms.layout.KKLayout
setMaxIterations(int) - Method in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer: Sets the maximum number of times that evaluate will call step.
setMaxIterations(int) - Method in class edu.uci.ics.jung.algorithms.util.KMeansClusterer
setMaxTargets(int) - Method in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance: Allows the user to specify the maximum number of target vertices per source vertex for which this instance will calculate distances.
setNormalizeRankings(boolean) - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker: Allows the user to specify whether or not s/he wants the rankings to be normalized.
setOutputValue(V, T) - Method in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer: Sets the output value for this vertex.
setPolars(List<V>, Point2D, double) - Method in class edu.uci.ics.jung.algorithms.layout.BalloonLayout
setPrecision(double) - Method in class edu.uci.ics.jung.algorithms.util.IterativeProcess
setPriorRankScore(V, double) - Method in class edu.uci.ics.jung.algorithms.importance.RelativeAuthorityRanker: Allows the user to specify a value to set for the prior rank score
setPriors(Set<V>) - Method in class edu.uci.ics.jung.algorithms.importance.RelativeAuthorityRanker: Specifies which vertices are root nodes (priors).
setRadius(double) - Method in class edu.uci.ics.jung.algorithms.layout.CircleLayout: Sets the radius of the circle.
setRadius(double) - Method in class edu.uci.ics.jung.algorithms.layout.PolarPoint
setRandom(Random) - Method in class edu.uci.ics.jung.algorithms.generators.random.KleinbergSmallWorldGenerator: Sets the Random instance used by this instance.
setRandomSeed(int) - Method in class edu.uci.ics.jung.algorithms.cluster.VoltageClusterer
setRandomSeed(long) - Method in class edu.uci.ics.jung.algorithms.generators.random.KleinbergSmallWorldGenerator: Sets the seed of the internal random number generator.
setRandomSeed(long) - Method in class edu.uci.ics.jung.algorithms.util.WeightedChoice
setRanked(V) - Method in class edu.uci.ics.jung.algorithms.importance.Ranking
setRemoveRankScoresOnFinalize(boolean) - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker: Instructs the ranker whether or not it should remove the rank scores from the nodes (or edges) once the ranks have been computed.
setRepulsionMultiplier(double) - Method in class edu.uci.ics.jung.algorithms.layout.FRLayout
setRepulsionMultiplier(double) - Method in class edu.uci.ics.jung.algorithms.layout.FRLayout2
setRepulsionRange(int) - Method in class edu.uci.ics.jung.algorithms.layout.SpringLayout: Sets the node repulsion range (in drawing area units) for this instance.
setRoot() - Method in class edu.uci.ics.jung.algorithms.layout.DAGLayout: Calculates the level of each vertex in the graph.
setRoot(V) - Method in class edu.uci.ics.jung.algorithms.layout.DAGLayout: Set vertex v to be level 0.
setRootPolar(V) - Method in class edu.uci.ics.jung.algorithms.layout.BalloonLayout
setRootPolars() - Method in class edu.uci.ics.jung.algorithms.layout.BalloonLayout
setSeed(long) - Method in class edu.uci.ics.jung.algorithms.generators.random.EppsteinPowerLawGenerator: Sets the seed for the random number generator.
setSeed(long) - Method in class edu.uci.ics.jung.algorithms.generators.random.ErdosRenyiGenerator: Sets the seed of the internal random number generator to seed.
setSeed(int) - Method in class edu.uci.ics.jung.algorithms.util.KMeansClusterer: Sets the seed used by the internal random number generator.
setSize(Dimension) - Method in class edu.uci.ics.jung.algorithms.layout.AbstractLayout: When a visualization is resized, it presumably wants to fix the locations of the vertices and possibly to reinitialize its data.
setSize(Dimension) - Method in class edu.uci.ics.jung.algorithms.layout.AggregateLayout
setSize(Dimension) - Method in class edu.uci.ics.jung.algorithms.layout.BalloonLayout
setSize(Dimension) - Method in class edu.uci.ics.jung.algorithms.layout.DAGLayout
setSize(Dimension) - Method in class edu.uci.ics.jung.algorithms.layout.FRLayout
setSize(Dimension) - Method in class edu.uci.ics.jung.algorithms.layout.FRLayout2
setSize(Dimension) - Method in class edu.uci.ics.jung.algorithms.layout.KKLayout
setSize(Dimension) - Method in interface edu.uci.ics.jung.algorithms.layout.Layout
setSize(Dimension) - Method in class edu.uci.ics.jung.algorithms.layout.LayoutDecorator
setSize(Dimension) - Method in class edu.uci.ics.jung.algorithms.layout.RadialTreeLayout
setSize(Dimension) - Method in class edu.uci.ics.jung.algorithms.layout.SpringLayout
setSize(Dimension) - Method in class edu.uci.ics.jung.algorithms.layout.TreeLayout: This method is not supported by this class.
setSleepTime(long) - Method in interface edu.uci.ics.jung.algorithms.layout.util.Relaxer
setSleepTime(long) - Method in class edu.uci.ics.jung.algorithms.layout.util.VisRunner
setStretch(double) - Method in class edu.uci.ics.jung.algorithms.layout.SpringLayout: Sets the stretch parameter for this instance.
SettableTransformer<I,O> - Interface in edu.uci.ics.jung.algorithms.util: An interface for classes that can set the value to be returned (from transform()) when invoked on a given input.
setTheta(double) - Method in class edu.uci.ics.jung.algorithms.layout.PolarPoint
setTolerance(double) - Method in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer: Sets the size of the largest change (difference between the current and previous values) for any vertex that can be tolerated.
setValue(V) - Method in class edu.uci.ics.jung.algorithms.util.BasicMapEntry
setVertexOrder(Comparator<V>) - Method in class edu.uci.ics.jung.algorithms.layout.CircleLayout: Sets the order of the vertices in the layout according to the ordering specified by comparator.
setVertexOrder(List<V>) - Method in class edu.uci.ics.jung.algorithms.layout.CircleLayout: Sets the order of the vertices in the layout according to the ordering of vertex_list.
setVertexRankScore(V, double, Object) - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker
setVertexRankScore(V, double) - Method in class edu.uci.ics.jung.algorithms.importance.AbstractRanker
ShortestPath<V,E> - Interface in edu.uci.ics.jung.algorithms.shortestpath: An interface for algorithms that calculate shortest paths.
ShortestPathUtils - Class in edu.uci.ics.jung.algorithms.shortestpath: Utilities relating to the shortest paths in a graph.
ShortestPathUtils() - Constructor for class edu.uci.ics.jung.algorithms.shortestpath.ShortestPathUtils
shouldCount(Graph<V, E>, List<V>, V, V, V) - Static method in class edu.uci.ics.jung.algorithms.metrics.TriadicCensus: Return true iff this ordering is canonical and therefore we should build statistics for it.
singleSourceShortestPath(V, Collection<V>, int) - Method in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance: Implements Dijkstra's single-source shortest-path algorithm for weighted graphs.
sinks - Variable in class edu.uci.ics.jung.algorithms.scoring.VoltageScorer
size - Variable in class edu.uci.ics.jung.algorithms.layout.AbstractLayout
size - Variable in class edu.uci.ics.jung.algorithms.layout.TreeLayout
size() - Method in class edu.uci.ics.jung.algorithms.util.MapBinaryHeap
sleepTime - Variable in class edu.uci.ics.jung.algorithms.layout.util.VisRunner: how long the relaxer thread pauses between iteration loops.
source_voltages - Variable in class edu.uci.ics.jung.algorithms.scoring.VoltageScorer
SourceData(V) - Constructor for class edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance.SourceData
sourceMap - Variable in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance
SourcePathData(V) - Constructor for class edu.uci.ics.jung.algorithms.shortestpath.DijkstraShortestPath.SourcePathData
SpringDimensionChecker() - Constructor for class edu.uci.ics.jung.algorithms.layout.SpringLayout.SpringDimensionChecker
SpringLayout<V,E> - Class in edu.uci.ics.jung.algorithms.layout: The SpringLayout package represents a visualization of a set of nodes.
SpringLayout(Graph<V, E>) - Constructor for class edu.uci.ics.jung.algorithms.layout.SpringLayout: Constructor for a SpringLayout for a raw graph with associated dimension--the input knows how big the graph is.
SpringLayout(Graph<V, E>, Function<? super E, Integer>) - Constructor for class edu.uci.ics.jung.algorithms.layout.SpringLayout: Constructor for a SpringLayout for a raw graph with associated component.
SpringLayout.SpringDimensionChecker - Class in edu.uci.ics.jung.algorithms.layout: Used for changing the size of the layout in response to a component's size.
SpringLayout.SpringVertexData - Class in edu.uci.ics.jung.algorithms.layout
SpringLayout2<V,E> - Class in edu.uci.ics.jung.algorithms.layout: The SpringLayout package represents a visualization of a set of nodes.
SpringLayout2(Graph<V, E>) - Constructor for class edu.uci.ics.jung.algorithms.layout.SpringLayout2: Constructor for a SpringLayout for a raw graph with associated dimension--the input knows how big the graph is.
SpringLayout2(Graph<V, E>, Function<E, Integer>) - Constructor for class edu.uci.ics.jung.algorithms.layout.SpringLayout2: Constructor for a SpringLayout for a raw graph with associated component.
springVertexData - Variable in class edu.uci.ics.jung.algorithms.layout.SpringLayout
SpringVertexData() - Constructor for class edu.uci.ics.jung.algorithms.layout.SpringLayout.SpringVertexData
squaredError(double[], double[]) - Static method in class edu.uci.ics.jung.algorithms.util.DiscreteDistribution: Returns the squared difference between the two specified distributions, which must have the same number of elements.
stack - Variable in class edu.uci.ics.jung.algorithms.cluster.BicomponentClusterer
StaticLayout<V,E> - Class in edu.uci.ics.jung.algorithms.layout: StaticLayout places the vertices in the locations specified by its initializer, and has no other behavior.
StaticLayout(Graph<V, E>, Function<V, Point2D>, Dimension) - Constructor for class edu.uci.ics.jung.algorithms.layout.StaticLayout
StaticLayout(Graph<V, E>, Function<V, Point2D>) - Constructor for class edu.uci.ics.jung.algorithms.layout.StaticLayout
StaticLayout(Graph<V, E>) - Constructor for class edu.uci.ics.jung.algorithms.layout.StaticLayout
StaticLayout(Graph<V, E>, Dimension) - Constructor for class edu.uci.ics.jung.algorithms.layout.StaticLayout
step() - Method in class edu.uci.ics.jung.algorithms.flows.EdmondsKarpMaxFlow
step() - Method in class edu.uci.ics.jung.algorithms.importance.BetweennessCentrality
step() - Method in class edu.uci.ics.jung.algorithms.importance.KStepMarkov
step() - Method in class edu.uci.ics.jung.algorithms.importance.WeightedNIPaths
step() - Method in class edu.uci.ics.jung.algorithms.layout.AggregateLayout: Call step on any sublayout that is also an IterativeContext and is not done
step() - Method in class edu.uci.ics.jung.algorithms.layout.FRLayout: Moves the iteration forward one notch, calculation attraction and repulsion between vertices and edges and cooling the temperature.
step() - Method in class edu.uci.ics.jung.algorithms.layout.FRLayout2: Moves the iteration forward one notch, calculation attraction and repulsion between vertices and edges and cooling the temperature.
step() - Method in class edu.uci.ics.jung.algorithms.layout.ISOMLayout: Advances the current positions of the graph elements.
step() - Method in class edu.uci.ics.jung.algorithms.layout.KKLayout
step() - Method in class edu.uci.ics.jung.algorithms.layout.LayoutDecorator
step() - Method in class edu.uci.ics.jung.algorithms.layout.SpringLayout: Relaxation step.
step() - Method in class edu.uci.ics.jung.algorithms.layout.SpringLayout2: Relaxation step.
step() - Method in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer: Performs one step of this algorithm; updates the state (value) for each vertex.
step() - Method in interface edu.uci.ics.jung.algorithms.util.IterativeContext: Advances one step.
step() - Method in class edu.uci.ics.jung.algorithms.util.IterativeProcess: Evaluate the result of the current iteration.
stop() - Method in interface edu.uci.ics.jung.algorithms.layout.util.Relaxer: Set flags to stop the relaxer thread.
stop - Variable in class edu.uci.ics.jung.algorithms.layout.util.VisRunner
stop() - Method in class edu.uci.ics.jung.algorithms.layout.util.VisRunner
stretch - Variable in class edu.uci.ics.jung.algorithms.layout.SpringLayout
StructuralHoles<V,E> - Class in edu.uci.ics.jung.algorithms.metrics: Calculates some of the measures from Burt's text "Structural Holes: The Social Structure of Competition".
StructuralHoles(Graph<V, E>, Function<E, ? extends Number>) - Constructor for class edu.uci.ics.jung.algorithms.metrics.StructuralHoles
StructurallyEquivalent<V,E> - Class in edu.uci.ics.jung.algorithms.blockmodel: Identifies sets of structurally equivalent vertices in a graph.
StructurallyEquivalent() - Constructor for class edu.uci.ics.jung.algorithms.blockmodel.StructurallyEquivalent
swapOutputForCurrent() - Method in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer
symmetricKL(double[], double[]) - Static method in class edu.uci.ics.jung.algorithms.util.DiscreteDistribution

T

tentativeIncomingEdges - Variable in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraShortestPath.SourcePathData
thread - Variable in class edu.uci.ics.jung.algorithms.layout.util.VisRunner
toDirected(Graph<V, E>, Supplier<DirectedGraph<V, E>>, Supplier<E>, boolean) - Static method in class edu.uci.ics.jung.algorithms.transformation.DirectionTransformer: Transforms graph (which may be of any directionality) into a directed graph.
tolerance - Variable in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer: Minimum change from one step to the next; if all changes are ≤ tolerance, no further updates will occur.
toString() - Method in class edu.uci.ics.jung.algorithms.blockmodel.VertexPartition
toString() - Method in class edu.uci.ics.jung.algorithms.importance.Ranking: Returns the rank score as a string.
toString() - Method in class edu.uci.ics.jung.algorithms.layout.CircleLayout.CircleVertexData
toString() - Method in class edu.uci.ics.jung.algorithms.layout.PolarPoint
toString() - Method in class edu.uci.ics.jung.algorithms.scoring.HITS.Scores
toString() - Method in class edu.uci.ics.jung.algorithms.util.BasicMapEntry
total_iterations - Variable in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer: The total number of iterations used so far.
toUndirected(Graph<V, E>, Supplier<UndirectedGraph<V, E>>, Supplier<E>, boolean) - Static method in class edu.uci.ics.jung.algorithms.transformation.DirectionTransformer: Transforms graph (which may be of any directionality) into an undirected graph.
transform(V) - Method in class edu.uci.ics.jung.algorithms.layout.LayoutDecorator
treeFactory - Variable in class edu.uci.ics.jung.algorithms.shortestpath.PrimMinimumSpanningTree
TreeLayout<V,E> - Class in edu.uci.ics.jung.algorithms.layout
TreeLayout(Forest<V, E>) - Constructor for class edu.uci.ics.jung.algorithms.layout.TreeLayout: Creates an instance for the specified graph with default X and Y distances.
TreeLayout(Forest<V, E>, int) - Constructor for class edu.uci.ics.jung.algorithms.layout.TreeLayout: Creates an instance for the specified graph and X distance with default Y distance.
TreeLayout(Forest<V, E>, int, int) - Constructor for class edu.uci.ics.jung.algorithms.layout.TreeLayout: Creates an instance for the specified graph, X distance, and Y distance.
TRIAD_NAMES - Static variable in class edu.uci.ics.jung.algorithms.metrics.TriadicCensus
TriadicCensus - Class in edu.uci.ics.jung.algorithms.metrics: TriadicCensus is a standard social network tool that counts, for each of the different possible configurations of three vertices, the number of times that that configuration occurs in the given graph.
TriadicCensus() - Constructor for class edu.uci.ics.jung.algorithms.metrics.TriadicCensus
triCode(Graph<V, E>, V, V, V) - Static method in class edu.uci.ics.jung.algorithms.metrics.TriadicCensus: This is the core of the technique in the paper.
triType(int) - Static method in class edu.uci.ics.jung.algorithms.metrics.TriadicCensus

U

UniformDegreeWeight<V,E> - Class in edu.uci.ics.jung.algorithms.scoring.util: An edge weight function that assigns weights as uniform transition probabilities.
UniformDegreeWeight(Hypergraph<V, E>) - Constructor for class edu.uci.ics.jung.algorithms.scoring.util.UniformDegreeWeight
UniformInOut<V,E> - Class in edu.uci.ics.jung.algorithms.scoring.util: Assigns weights to directed edges (the edge of the vertex/edge pair) depending on whether the vertex is the edge's source or its destination.
UniformInOut(Graph<V, E>) - Constructor for class edu.uci.ics.jung.algorithms.scoring.util.UniformInOut: Creates an instance for the specified graph.
unknownVertices - Variable in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance.SourceData
UnweightedShortestPath<V,E> - Class in edu.uci.ics.jung.algorithms.shortestpath: Computes the shortest path distances for graphs whose edges are not weighted (using BFS).
UnweightedShortestPath(Hypergraph<V, E>) - Constructor for class edu.uci.ics.jung.algorithms.shortestpath.UnweightedShortestPath: Constructs and initializes algorithm
update(V) - Method in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer: Updates the value for v.
update(V) - Method in class edu.uci.ics.jung.algorithms.scoring.HITSWithPriors: Updates the value for this vertex.
update(V) - Method in class edu.uci.ics.jung.algorithms.scoring.KStepMarkov: Updates the value for this vertex.
update(V) - Method in class edu.uci.ics.jung.algorithms.scoring.PageRankWithPriors: Updates the value for this vertex.
update(V) - Method in class edu.uci.ics.jung.algorithms.scoring.VoltageScorer
update(V, E, double) - Method in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance.SourceData
update(V, E, double) - Method in class edu.uci.ics.jung.algorithms.shortestpath.DijkstraShortestPath.SourcePathData
update(T) - Method in class edu.uci.ics.jung.algorithms.util.MapBinaryHeap: Informs the heap that this object's internal key value has been updated, and that its place in the heap may need to be shifted (up or down).
updateForest(Collection<V>, Collection<E>) - Method in class edu.uci.ics.jung.algorithms.shortestpath.MinimumSpanningForest
updateMaxDelta(V, double) - Method in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorer
updateRankings() - Method in class edu.uci.ics.jung.algorithms.importance.KStepMarkov
updateTree(Graph<V, E>, Graph<V, E>, Collection<E>) - Method in class edu.uci.ics.jung.algorithms.shortestpath.PrimMinimumSpanningTree

V

valueOf(String) - Static method in enum edu.uci.ics.jung.algorithms.filters.KNeighborhoodFilter.EdgeType: Returns the enum constant of this type with the specified name.
values() - Static method in enum edu.uci.ics.jung.algorithms.filters.KNeighborhoodFilter.EdgeType: Returns an array containing the constants of this enum type, in the order they are declared.
VEPair<V,E> - Class in edu.uci.ics.jung.algorithms.scoring.util: Convenience class for associating a vertex and an edge.
VEPair(V, E) - Constructor for class edu.uci.ics.jung.algorithms.scoring.util.VEPair: Creates an instance with the specified vertex and edge
vertex_data - Variable in class edu.uci.ics.jung.algorithms.scoring.BetweennessCentrality
vertex_factory - Variable in class edu.uci.ics.jung.algorithms.generators.Lattice2DGenerator
vertex_factory - Variable in class edu.uci.ics.jung.algorithms.transformation.VertexPartitionCollapser
vertex_index - Variable in class edu.uci.ics.jung.algorithms.generators.random.BarabasiAlbertGenerator
vertex_pred - Variable in class edu.uci.ics.jung.algorithms.filters.VertexPredicateFilter
vertex_priors - Variable in class edu.uci.ics.jung.algorithms.scoring.AbstractIterativeScorerWithPriors: The prior probability of each vertex being visited on a given 'jump' (non-link-following) step.
vertex_scores - Variable in class edu.uci.ics.jung.algorithms.scoring.BetweennessCentrality
VertexComparator(Map<V, Number>) - Constructor for class edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance.VertexComparator
vertexFactory - Variable in class edu.uci.ics.jung.algorithms.generators.random.BarabasiAlbertGenerator
VertexPartition<V,E> - Class in edu.uci.ics.jung.algorithms.blockmodel: Maintains information about a vertex partition of a graph.
VertexPartition(Graph<V, E>, Map<V, Set<V>>) - Constructor for class edu.uci.ics.jung.algorithms.blockmodel.VertexPartition: 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>, Map<V, Set<V>>, Collection<Set<V>>) - Constructor for class edu.uci.ics.jung.algorithms.blockmodel.VertexPartition: Creates an instance based on the specified graph, vertex-set mapping, and set of disjoint vertex sets.
VertexPartition(Graph<V, E>, Collection<Set<V>>) - Constructor for class edu.uci.ics.jung.algorithms.blockmodel.VertexPartition: 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.
VertexPartitionCollapser<V,E,CV,CE> - Class in edu.uci.ics.jung.algorithms.transformation: This class transforms a graph with a known vertex partitioning into a graph whose vertices correspond to the input graph's partitions.
VertexPartitionCollapser(Supplier<Graph<CV, CE>>, Supplier<CV>, Supplier<CE>) - Constructor for class edu.uci.ics.jung.algorithms.transformation.VertexPartitionCollapser: Creates an instance with the specified graph and element factories.
VertexPredicateFilter<V,E> - Class in edu.uci.ics.jung.algorithms.filters: Transforms the input graph into one which contains only those vertices that pass the specified Predicate.
VertexPredicateFilter(Predicate<V>) - Constructor for class edu.uci.ics.jung.algorithms.filters.VertexPredicateFilter: Creates an instance based on the specified vertex Predicate.
vertexRankScores - Variable in class edu.uci.ics.jung.algorithms.importance.AbstractRanker
VertexScorer<V,S> - Interface in edu.uci.ics.jung.algorithms.scoring: An interface for algorithms that assign scores to vertices.
VertexScoreTransformer<V,S> - Class in edu.uci.ics.jung.algorithms.scoring.util: A Function convenience wrapper around VertexScorer.
VertexScoreTransformer(VertexScorer<V, S>) - Constructor for class edu.uci.ics.jung.algorithms.scoring.util.VertexScoreTransformer: Creates an instance based on the specified VertexScorer.
VisRunner - Class in edu.uci.ics.jung.algorithms.layout.util: Implementation of a relaxer thread for layouts.
VisRunner(IterativeContext) - Constructor for class edu.uci.ics.jung.algorithms.layout.util.VisRunner: Creates an instance for the specified process.
VoltageClusterer<V,E> - Class in edu.uci.ics.jung.algorithms.cluster: Clusters vertices of a Graph based on their ranks as calculated by VoltageScorer.
VoltageClusterer(Graph<V, E>, int) - Constructor for class edu.uci.ics.jung.algorithms.cluster.VoltageClusterer: Creates an instance of a VoltageCluster with the specified parameters.
VoltageClusterer.MapValueArrayComparator - Class in edu.uci.ics.jung.algorithms.cluster
VoltageScorer<V,E> - Class in edu.uci.ics.jung.algorithms.scoring: Assigns scores to vertices according to their 'voltage' in an approximate solution to the Kirchoff equations.
VoltageScorer(Hypergraph<V, E>, Function<? super E, ? extends Number>, Map<V, ? extends Number>, Collection<V>) - Constructor for class edu.uci.ics.jung.algorithms.scoring.VoltageScorer: Creates an instance with the specified graph, edge weights, source voltages, and sinks.
VoltageScorer(Hypergraph<V, E>, Function<? super E, ? extends Number>, Collection<V>, Collection<V>) - Constructor for class edu.uci.ics.jung.algorithms.scoring.VoltageScorer: Creates an instance with the specified graph, edge weights, source vertices (each of whose 'voltages' are tied to 1), and sinks.
VoltageScorer(Hypergraph<V, E>, Collection<V>, Collection<V>) - Constructor for class edu.uci.ics.jung.algorithms.scoring.VoltageScorer: Creates an instance with the specified graph, source vertices (each of whose 'voltages' are tied to 1), and sinks.
VoltageScorer(Hypergraph<V, E>, Map<V, ? extends Number>, Collection<V>) - Constructor for class edu.uci.ics.jung.algorithms.scoring.VoltageScorer: Creates an instance with the specified graph, source voltages, and sinks.
VoltageScorer(Hypergraph<V, E>, Function<? super E, ? extends Number>, V, V) - Constructor for class edu.uci.ics.jung.algorithms.scoring.VoltageScorer: Creates an instance with the specified graph, edge weights, source, and sink.
VoltageScorer(Hypergraph<V, E>, V, V) - Constructor for class edu.uci.ics.jung.algorithms.scoring.VoltageScorer: Creates an instance with the specified graph, edge weights, source, and sink.
vs - Variable in class edu.uci.ics.jung.algorithms.scoring.util.VertexScoreTransformer: The VertexScorer instance that provides the values returned by transform.

W

WeakComponentClusterer<V,E> - Class in edu.uci.ics.jung.algorithms.cluster: Finds all weak components in a graph as sets of vertex sets.
WeakComponentClusterer() - Constructor for class edu.uci.ics.jung.algorithms.cluster.WeakComponentClusterer
WEIGHTED_NIPATHS_KEY - Static variable in class edu.uci.ics.jung.algorithms.importance.WeightedNIPaths
WeightedChoice<T> - Class in edu.uci.ics.jung.algorithms.util: Selects items according to their probability in an arbitrary probability distribution.
WeightedChoice(Map<T, ? extends Number>) - Constructor for class edu.uci.ics.jung.algorithms.util.WeightedChoice: Equivalent to this(item_weights, new Random(), DEFAULT_THRESHOLD).
WeightedChoice(Map<T, ? extends Number>, double) - Constructor for class edu.uci.ics.jung.algorithms.util.WeightedChoice: Equivalent to this(item_weights, new Random(), threshold).
WeightedChoice(Map<T, ? extends Number>, Random) - Constructor for class edu.uci.ics.jung.algorithms.util.WeightedChoice: Equivalent to this(item_weights, random, DEFAULT_THRESHOLD).
WeightedChoice(Map<T, ? extends Number>, Random, double) - Constructor for class edu.uci.ics.jung.algorithms.util.WeightedChoice: Creates an instance with the specified mapping from items to weights, random number generator, and threshold value.
WeightedNIPaths<V,E> - Class in edu.uci.ics.jung.algorithms.importance: This algorithm measures the importance of nodes based upon both the number and length of disjoint paths that lead to a given node from each of the nodes in the root set.
WeightedNIPaths(DirectedGraph<V, E>, Supplier<V>, Supplier<E>, double, int, Set<V>) - Constructor for class edu.uci.ics.jung.algorithms.importance.WeightedNIPaths: Constructs and initializes the algorithm.
weights - Variable in class edu.uci.ics.jung.algorithms.shortestpath.MinimumSpanningForest
weights - Variable in class edu.uci.ics.jung.algorithms.shortestpath.MinimumSpanningForest2
weights - Variable in class edu.uci.ics.jung.algorithms.shortestpath.PrimMinimumSpanningTree

A B C D E F G H I K L M N O P R S T U V W