Uses of Class
net.walend.measured.AbstractShortestGEDistances

Packages that use AbstractShortestGEDistances

net.walend.measured

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

Uses of AbstractShortestGEDistances in net.walend.measured

Subclasses of AbstractShortestGEDistances in net.walend.measured

class	DijkstraShortestGEDistances DijkstraShortestGEDistances is an abstract class that holds Dijkstra's algorithm.
class	FloydWarshallShortestGEDistances FloydWarshallShortestGEDistances uses the very simple Floyd-Warshall algorithm to find the shortest distances.
class	JITShortestGEDistances JITShortestGEDistances is an implementation of ShortestGEDistances that uses Dijkstra's algorithm to find the shortest distances just in time.
class	JohnsonShortestGEDistances JohnsonShortestGEDistances uses Johnson's algorithm to find the shortest distances during construction.