Uses of Class
net.walend.measured.CENegativeWeightCycleException

Packages that use CENegativeWeightCycleException
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 CENegativeWeightCycleException in net.walend.measured
 

Methods in net.walend.measured that throw CENegativeWeightCycleException
protected  void AbstractShortestCEPaths.bfTest()
           
abstract  void AbstractShortestCEPaths.recalculate()
          If the digraph is not valid, rediscover the shortest paths.
 void FloydWarshallShortestCEDistances.recalculate()
          If the digraph is not valid, rediscover the shortest distances.
 void ShortestCEDistances.recalculate()
          If the digraph is not valid, rediscover the shortest paths.
static void BellmanFordTest.test(IndexedCEDigraph ceDigraph, PathMeter pathMeter)
          Deprecated. Use CEBellmanFordTest
 void JohnsonShortestCEDistances.recalculate()
          If the digraph is not valid, rediscover the shortest distances.
 void JITShortestCEDistances.recalculate()
          If the digraph is not valid, rediscover the shortest paths.
 void CEPathsFromShortestDistances.recalculate()
          If the digraph is not valid, rediscover the shortest paths.
static void CEBellmanFordTest.test(IndexedCEDigraph ceDigraph, CEPathMeter pathMeter)
           
private  void CEBellmanFordTest.bellmanFordTest()
          Uses the Bellman Ford algorithm to get some initial values in the delegate digraph.
 void CEBellmanFordTest.recalculate()
          If the digraph is not valid, rediscover the shortest paths.
 void JohnsonShortestCEPaths.recalculate()
          If the digraph is not valid, rediscover the shortest paths.
 void FloydWarshallShortestCEPaths.recalculate()
          If the digraph is not valid, rediscover the shortest paths.
protected  void AbstractShortestCEDistances.bfTest()
           
abstract  void AbstractShortestCEDistances.recalculate()
          Rediscover the shortest paths.
 void JITShortestCEPaths.recalculate()
          If the digraph is not valid, rediscover the shortest paths.
 

Constructors in net.walend.measured that throw CENegativeWeightCycleException
AbstractShortestCEPaths(IndexedCEDigraph ceDigraph, IndexedMutableCEDigraph delegate, CEPathMeter pathMeter)
           
FloydWarshallShortestCEDistances(IndexedCEDigraph ceDigraph, CEPathMeter pathMeter)
           
JohnsonShortestCEDistances(IndexedCEDigraph ceDigraph, CEPathMeter pathMeter)
           
JITShortestCEDistances(IndexedCEDigraph ceDigraph, CEPathMeter pathMeter)
           
DijkstraShortestCEPaths(IndexedCEDigraph ceDigraph, CEPathMeter pathMeter)
           
DijkstraShortestCEPaths(IndexedCEDigraph ceDigraph, IndexedMutableCEDigraph delegate, CEPathMeter pathMeter)
           
CEBellmanFordTest(IndexedCEDigraph ceDigraph, CEPathMeter pathMeter)
           
JohnsonShortestCEPaths(IndexedCEDigraph ceDigraph, CEPathMeter pathMeter)
           
JohnsonShortestCEPaths(IndexedCEDigraph ceDigraph, IndexedMutableCEDigraph delegate, CEPathMeter pathMeter)
           
FloydWarshallShortestCEPaths(IndexedCEDigraph ceDigraph, CEPathMeter pathMeter)
           
FloydWarshallShortestCEPaths(IndexedCEDigraph ceDigraph, IndexedMutableCEDigraph delegate, CEPathMeter pathMeter)
           
AbstractShortestCEDistances(IndexedCEDigraph ceDigraph, CEPathMeter pathMeter)
           
DijkstraShortestCEDistances(IndexedCEDigraph ceDigraph, CEPathMeter pathMeter)
           
JITShortestCEPaths(IndexedCEDigraph ceDigraph, CEPathMeter pathMeter)
           
JITShortestCEPaths(IndexedCEDigraph ceDigraph, IndexedMutableCEDigraph delegate, CEPathMeter pathMeter)
           
 

Uses of CENegativeWeightCycleException in net.walend.measured.test
 

Methods in net.walend.measured.test that throw CENegativeWeightCycleException
protected abstract  ShortestCEDistances ShortestCEDistancesTest.createShortestCEDistances(IndexedCEDigraph digraph)
           
protected  ShortestCEDistances JohnsonCEDistancesTest.createShortestCEDistances(IndexedCEDigraph digraph)
           
protected  ShortestCEPaths FloydWarshallCEPathTest.createShortestCEPaths(IndexedCEDigraph digraph)
           
protected  ShortestCEPaths JohnsonCEPathTest.createShortestCEPaths(IndexedCEDigraph digraph)
           
protected  ShortestCEDistances JITCEDistancesTest.createShortestCEDistances(IndexedCEDigraph digraph)
           
protected abstract  ShortestCEPaths ShortestCEPathTest.createShortestCEPaths(IndexedCEDigraph digraph)
           
protected  ShortestCEPaths CEPathsFromShortestDistancesTest.createShortestCEPaths(IndexedCEDigraph digraph)
           
protected  ShortestCEPaths JITCEPathTest.createShortestCEPaths(IndexedCEDigraph digraph)
           
protected  ShortestCEDistances FloydWarshallCEDistancesTest.createShortestCEDistances(IndexedCEDigraph digraph)
           
 



Copyright (c) 2001, 2002, David Walend