Overview | Package | Class | Use | Tree | Deprecated | Index | Help
PREV NEXT | FRAMES NO FRAMES

## Uses of Class
edu.uci.ics.jung.utils.Pair

Packages that use Pair
edu.uci.ics.jung.algorithms.importance | Provides a set of algorithms for computing the importance of each node (or edge) in a graph relative to all others (or, for the algorithms that inherit from `RelativeAuthorityRanker`, relative to a specified subset of elements).
edu.uci.ics.jung.algorithms.shortestpath | Provides a set of algorithms for computing the shortest path between two nodes or between each pair of nodes in a graph.
edu.uci.ics.jung.graph | Specifies the interfaces for and capabilities of the JUNG vertex, edge, and graph classes.
edu.uci.ics.jung.graph.impl | Implementations of the JUNG vertex, edge, and graph interfaces.
edu.uci.ics.jung.utils | Provides a series of useful utility methods, and a number of custom helper classes designed specifically for this application.
samples.preview_new_graphdraw.iter |

Uses of Pair in edu.uci.ics.jung.algorithms.importance

Constructors in edu.uci.ics.jung.algorithms.importance with parameters of type Pair
`PageRank(DirectedGraph graph, double bias, String edgeWeightKeyName, Pair reachables)`

Uses of Pair in edu.uci.ics.jung.algorithms.shortestpath

Methods in edu.uci.ics.jung.algorithms.shortestpath that return Pair
`Pair` | `DijkstraDistance.SourceData.getNextVertex()`
`Pair` | `DijkstraShortestPath.SourcePathData.getNextVertex()`

Uses of Pair in edu.uci.ics.jung.graph

Methods in edu.uci.ics.jung.graph that return Pair
`Pair` | `Edge.getEndpoints()` Returns a pair consisting of both incident vertices.

Uses of Pair in edu.uci.ics.jung.graph.impl

Methods in edu.uci.ics.jung.graph.impl that return Pair
`Pair` | `AbstractSparseEdge.getEndpoints()`

Uses of Pair in edu.uci.ics.jung.utils

Methods in edu.uci.ics.jung.utils that return Pair
`protected Pair` | `UnifiedUserData.getUserDatumValuePair(Object key)`

Uses of Pair in samples.preview_new_graphdraw.iter

Methods in samples.preview_new_graphdraw.iter that return Pair
`static Pair` | `UpdatableIterableLayout.getSymmetricDifference(Set set1, Set set2)` Returns a pair consisting of two collections: set1 - set2, and set2-set1.

Methods in samples.preview_new_graphdraw.iter with parameters of type Pair
`protected void` | `UpdatableIterableLayout.updateGraph(Pair oldAndNewVertices, Pair oldAndNewEdges)` This DEFAULT IMPLEMENTATION immediately removes all OLD items, and immediate creates new items for the NEW.

Overview | Package | Class | Use | Tree | Deprecated | Index | Help
PREV NEXT | FRAMES NO FRAMES