@DefaultAnnotationForParameters(value=edu.umd.cs.findbugs.annotations.NonNull.class) @DefaultAnnotationForMethods(value=edu.umd.cs.findbugs.annotations.NonNull.class)

Package cs132.dijkstra

Classes for perfoming Dijkstra's shortest path algorithm to find the shortest path in a weighted graph from a starting vertex to all other vertices.

See:
Description

Interface Summary

EdgeModel<E>

This interface allows you to describe a EdgeModel.

Class Summary

CharacterDistance	This provides a cost model for web page links based on the number of characters in the to URL that occur after the common prefix of the two URL's.
ShortestPath<E>	Perform Dijkstra's algorithm over a weighted, directed graph.
StringModel
UnitCost	This provides a cost model for web page links so that each link is distance 1.
WebPageCostModel	An abstract class for web page edge models.

Package cs132.dijkstra Description

Classes for perfoming Dijkstra's shortest path algorithm to find the shortest path in a weighted graph from a starting vertex to all other vertices.