Package | Description |
---|---|
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.statistics |
Provides a set of statistical tools for analyzing graphs.
|
edu.uci.ics.jung.visualization.contrib |
These are additional layouts contributed by various users.
|
samples.preview_new_graphdraw.iterablelayouts | |
scratch.scott |
Class and Description |
---|
DijkstraDistance
Calculates distances in a specified graph, using
Dijkstra's single-source-shortest-path algorithm.
|
DijkstraDistance.SourceData
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.
|
Distance
An interface for classes which calculate the distance between
one vertex and another.
|
ShortestPath |
Class and Description |
---|
Distance
An interface for classes which calculate the distance between
one vertex and another.
|
Class and Description |
---|
Distance
An interface for classes which calculate the distance between
one vertex and another.
|
UnweightedShortestPath
Computes the shortest path distances for graphs whose edges are not weighted (using BFS).
|
Class and Description |
---|
UnweightedShortestPath
Computes the shortest path distances for graphs whose edges are not weighted (using BFS).
|
Class and Description |
---|
UnweightedShortestPath
Computes the shortest path distances for graphs whose edges are not weighted (using BFS).
|