Uses of Class
net.walend.measured.DijkstraShortestCEDistances

Packages that use DijkstraShortestCEDistances

net.walend.measured

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

Uses of DijkstraShortestCEDistances in net.walend.measured

Subclasses of DijkstraShortestCEDistances in net.walend.measured

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.