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


package edu.uci.ics.jung.algorithms.shortestpath
Provides interfaces and classes for calculating (geodesic) distances and shortest paths. Currently includes:
  • DijkstraDistance: finds the distances from a specified source vertex to other vertices in a weighted graph with no negative cycles
  • DijkstraShortestPath: extends DijkstraDistance, also finds shortest paths
  • Distance: an interface for defining vertex-vertex distances
  • PrimMinimumSpanningTree: identifies the spanning tree for a graph of least total edge weight
  • ShortestPath: an interface for shortest-path algorithms
  • ShortestPathUtils: utility functions for manipulating shortest paths
  • UnweightedShortestPath: finds the distances from a specified source vertex to other vertices in an unweighted graph
  • Class
    Description
    Labels each node in the graph according to the BFS distance from the start node(s).
    Calculates distances in a specified graph, using Dijkstra's single-source-shortest-path algorithm.
    Compares according to distances, so that the BinaryHeap knows how to order the tree.
    Calculates distances and shortest paths using Dijkstra's single-source-shortest-path algorithm.
    An interface for classes which calculate the distance between one vertex and another.
    Statistics relating to vertex-vertex distances in a graph.
    For the input Graph, creates a MinimumSpanningTree using a variation of Prim's algorithm.
    For the input Graph, creates a MinimumSpanningTree using a variation of Prim's algorithm.
    For the input Graph, creates a MinimumSpanningTree using a variation of Prim's algorithm.
    An interface for algorithms that calculate shortest paths.
    Utilities relating to the shortest paths in a graph.
    Computes the shortest path distances for graphs whose edges are not weighted (using BFS).