Uses of Class
net.walend.measured.AbstractShortestCEDistances

Packages that use AbstractShortestCEDistances

net.walend.measured

This package contains a kit for working with measured paths on directed graphs.

Uses of AbstractShortestCEDistances in net.walend.measured

Subclasses of AbstractShortestCEDistances in net.walend.measured

class	DijkstraShortestCEDistances DijkstraShortestCEDistances is an abstract class that holds Dijkstra's algorithm.
class	FloydWarshallShortestCEDistances FloydWarshallShortestCEDistances uses the very simple Floyd-Warshall algorithm to find the shortest distances.
class	JITShortestCEDistances JITShortestCEDistances is an implementation of ShortestCEDistances that uses Dijkstra's algorithm to find the shortest distances just in time.
class	JohnsonShortestCEDistances JohnsonShortestCEDistances uses Johnson's algorithm to find the shortest distances during construction.