Uses of Interface
net.walend.measured.ShortestCEPaths

Packages that use ShortestCEPaths

net.walend.measured	This package contains a kit for working with measured paths on directed graphs.
net.walend.measured.test	This package contains a kit for testing measuring paths.

Uses of ShortestCEPaths in net.walend.measured

Classes in net.walend.measured that implement ShortestCEPaths

class	AbstractShortestCEPaths AbstractShortestCEPaths is a CEDigraph containing the nodes from the base digraph and edges that are the shortest paths between some pairs of nodes.
class	CEBellmanFordTest Performs the Bellman-Ford test for a given digraph and pathmeter.
class	CEPathsFromShortestDistances CEPathsFromShortestDistances wraps a ShortestCEDistances object to provide a full ShortestCEPaths interface.
class	DijkstraShortestCEPaths DijkstraShortestCEPaths is an abstract class that contains Dijkstra's algorithm for shortest paths, plus supporting code for solutions with nodes must go inside a hash table.
class	FloydWarshallShortestCEPaths FloydWarshallShortestCEPaths uses the very simple Floyd-Warshall algorithm to find the shortest paths.
class	JITShortestCEPaths JITShortestCEPaths is an implementation of ShortestCEPaths that uses Dijkstra's algorithm to find the shortest paths just in time.
class	JohnsonShortestCEPaths JohnsonShortestCEPaths uses Johnson's algorithm to find the shortest paths during construction.

Uses of ShortestCEPaths in net.walend.measured.test

Methods in net.walend.measured.test that return ShortestCEPaths

protected ShortestCEPaths	FloydWarshallCEPathTest.createShortestCEPaths(IndexedCEDigraph digraph)
protected ShortestCEPaths	JohnsonCEPathTest.createShortestCEPaths(IndexedCEDigraph digraph)
protected abstract ShortestCEPaths	ShortestCEPathTest.createShortestCEPaths(IndexedCEDigraph digraph)
protected ShortestCEPaths	CEPathsFromShortestDistancesTest.createShortestCEPaths(IndexedCEDigraph digraph)
protected ShortestCEPaths	JITCEPathTest.createShortestCEPaths(IndexedCEDigraph digraph)

Methods in net.walend.measured.test with parameters of type ShortestCEPaths

void	ShortestCEPathTest.testGetLength(ShortestCEPaths shortestPaths, java.lang.Object head, java.lang.Object tail, int expected, boolean nodeMissing)
protected void	ShortestCEPathTest.testAllValid(ShortestCEPaths digraph, boolean expected)