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

## Package 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.

See:
Description

Interface Summary
Distance | An interface for classes which calculate the distance between one vertex and another.
ShortestPath |

Class Summary
DijkstraDistance | Calculates distances in a specified graph, using Dijkstra's single-source-shortest-path algorithm.
DijkstraShortestPath | Calculates distances and shortest paths using Dijkstra's single-source-shortest-path algorithm.
ShortestPathUtils |
UnweightedShortestPath | Computes the shortest path distances for graphs whose edges are not weighted (using BFS).

## Package edu.uci.ics.jung.algorithms.shortestpath Description

Provides a set of algorithms for computing the shortest path between two nodes or between each pair of nodes in a graph. Depending on the properties of the graph will determine which algorithm to use.

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