net.walend.measured
Interface ShortestCEDistances

All Superinterfaces:

HasState

All Known Subinterfaces:

ShortestCEPaths

All Known Implementing Classes:

AbstractShortestCEDistances, AbstractShortestCEPaths, CEBellmanFordTest, CEPathsFromShortestDistances, DijkstraShortestCEDistances, DijkstraShortestCEPaths, FloydWarshallShortestCEDistances, FloydWarshallShortestCEPaths, JITShortestCEDistances, JITShortestCEPaths, JohnsonShortestCEDistances, JohnsonShortestCEPaths

public interface ShortestCEDistances

extends HasState

This interface describes methods to find the shortest distances on a CE digraph.

Implementations should not have mutator methods except recalculate(). Implementations should not be Immutable unless both the base digraph and the pathMeter are immutable.

Constructors should have a base digraph. Constructors may throw a NegativeWeightCycleException.

Author:

David Walend dfw1@cornell.edu

Method Summary

IndexedCEDigraph	getBase()
int	getLength(int from, int to)
int	getLength(java.lang.Object fromNode, java.lang.Object toNode)
CEPathMeter	getPathMeter() Return the path meter used to evaluate these shortest paths.
void	recalculate() If the digraph is not valid, rediscover the shortest paths.

Methods inherited from interface net.walend.collection.HasState

getPrincipleInterface, sameStateAs

Method Detail

getBase

public IndexedCEDigraph getBase()

recalculate

public void recalculate()
                 throws CENegativeWeightCycleException

If the digraph is not valid, rediscover the shortest paths.

CENegativeWeightCycleException

getPathMeter

public CEPathMeter getPathMeter()

Return the path meter used to evaluate these shortest paths.

getLength

public int getLength(java.lang.Object fromNode,
                     java.lang.Object toNode)
              throws NodeMissingException

NodeMissingException

getLength

public int getLength(int from,
                     int to)