Uses of Interface
net.walend.measured.ShortestCEDistances

Packages that use ShortestCEDistances

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 ShortestCEDistances in net.walend.measured

Subinterfaces of ShortestCEDistances in net.walend.measured

interface

ShortestCEPaths This interface is a DigraphOfCEPaths that contains the shortest paths in available in the base digraph as measured by a PathMeter.

Classes in net.walend.measured that implement ShortestCEDistances

class	AbstractShortestCEDistances AbstractShortestCEDistances contains a 2D array of distances between nodes in a directed graph.
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	DijkstraShortestCEDistances DijkstraShortestCEDistances is an abstract class that holds Dijkstra's algorithm.
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	FloydWarshallShortestCEDistances FloydWarshallShortestCEDistances uses the very simple Floyd-Warshall algorithm to find the shortest distances.
class	FloydWarshallShortestCEPaths FloydWarshallShortestCEPaths uses the very simple Floyd-Warshall algorithm to find the shortest paths.
class	JITShortestCEDistances JITShortestCEDistances is an implementation of ShortestCEDistances that uses Dijkstra's algorithm to find the shortest distances just in time.
class	JITShortestCEPaths JITShortestCEPaths is an implementation of ShortestCEPaths that uses Dijkstra's algorithm to find the shortest paths just in time.
class	JohnsonShortestCEDistances JohnsonShortestCEDistances uses Johnson's algorithm to find the shortest distances during construction.
class	JohnsonShortestCEPaths JohnsonShortestCEPaths uses Johnson's algorithm to find the shortest paths during construction.

Fields in net.walend.measured declared as ShortestCEDistances

private ShortestCEDistances

CEPathsFromShortestDistances.shortestDistances

Methods in net.walend.measured that return ShortestCEDistances

protected ShortestCEDistances

CEPathsFromShortestDistances.getDistances()

Constructors in net.walend.measured with parameters of type ShortestCEDistances

CEPathsFromShortestDistances(ShortestCEDistances shortestDistances, IndexedMutableCEDigraph delegate, TieBreaker tieBreaker)

Uses of ShortestCEDistances in net.walend.measured.test

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

protected abstract ShortestCEDistances	ShortestCEDistancesTest.createShortestCEDistances(IndexedCEDigraph digraph)
protected ShortestCEDistances	JohnsonCEDistancesTest.createShortestCEDistances(IndexedCEDigraph digraph)
protected ShortestCEDistances	JITCEDistancesTest.createShortestCEDistances(IndexedCEDigraph digraph)
protected ShortestCEDistances	FloydWarshallCEDistancesTest.createShortestCEDistances(IndexedCEDigraph digraph)

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

void	ShortestCEDistancesTest.testGetLength(ShortestCEDistances shortestDistances, java.lang.Object head, java.lang.Object tail, int expected, boolean nodeMissing)