agl2.alg
Class ShortestPath

java.lang.Object
  |
  +--agl2.alg.ShortestPath

public class ShortestPath

extends java.lang.Object

The ShortestPath description. This algorithm [10,8] solves the single-source shortest-paths problem on a weighted, directed or undirected graph for the case where all edge weights are nonnegative. Use the Bellman-Ford algorithm for the case when some edge weights are negative. Use breadth-first search instead of Dijkstra's algorithm when all edge weights are equal to one. For the definition of the shortest-path problem see Section Shortest-Paths Algorithms for some background to the shortest-path problem. http://www.boost.org/libs/graph/doc/dijkstra_shortest_paths.html

Constructor Summary

ShortestPath()

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

ShortestPath

public ShortestPath()