Package | Description |
---|---|
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 |
Constructor and Description |
---|
PageRank(DirectedGraph graph,
double bias,
java.lang.String edgeWeightKeyName,
Pair reachables) |
Modifier and Type | Method and Description |
---|---|
Pair |
DijkstraDistance.SourceData.getNextVertex() |
Pair |
DijkstraShortestPath.SourcePathData.getNextVertex() |
Modifier and Type | Method and Description |
---|---|
Pair |
Edge.getEndpoints()
Returns a pair consisting of both incident vertices.
|
Modifier and Type | Method and Description |
---|---|
Pair |
AbstractSparseEdge.getEndpoints() |
Modifier and Type | Method and Description |
---|---|
protected Pair |
UnifiedUserData.getUserDatumValuePair(java.lang.Object key) |
Modifier and Type | Method and Description |
---|---|
static Pair |
UpdatableIterableLayout.getSymmetricDifference(java.util.Set set1,
java.util.Set set2)
Returns a pair consisting of two collections: set1 - set2, and set2-set1.
|
Modifier and Type | Method and Description |
---|---|
protected void |
UpdatableIterableLayout.updateGraph(Pair oldAndNewVertices,
Pair oldAndNewEdges)
This DEFAULT IMPLEMENTATION immediately removes all OLD items, and
immediate creates new items for the NEW.
|