Uses of Class
net.walend.measured.DijkstraShortestGEDistances

Packages that use DijkstraShortestGEDistances

net.walend.measured

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

Uses of DijkstraShortestGEDistances in net.walend.measured

Subclasses of DijkstraShortestGEDistances in net.walend.measured

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.