Package org.protempa.graph

Class Summary

Class	Description
BellmanFord	An implementation of the Bellman-Ford single-source shortest paths algorithm.
DirectedGraph	A directed graph implementation.
Edge
Weight	Like a Long except that there are special values representing positive infinity, negative infinity, positive epsilon (smallest positive value), and negative epsilon (smallest negative value).
WeightFactory

Enum Summary

Enum	Description
BellmanFord.Mode	For setting whether the Bellman-Ford algorithm should look for the shortest paths from a source or to a destination.