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.
|
Modifier and Type | Class and Description |
---|---|
class |
DijkstraShortestPath
Calculates distances and shortest paths using Dijkstra's
single-source-shortest-path algorithm.
|
class |
UnweightedShortestPath
Computes the shortest path distances for graphs whose edges are not weighted (using BFS).
|
Modifier and Type | Method and Description |
---|---|
static java.util.List |
ShortestPathUtils.getPath(ShortestPath sp,
Vertex source,
Vertex target)
Returns a
List of the edges on the shortest path from
source to target , in order of their
occurrence on this path. |