net.walend.measured.test
Class ShortestCEPathTest.ShortPathMeter

java.lang.Object
  |
  +--net.walend.measured.test.ShortestCEPathTest.ShortPathMeter
All Implemented Interfaces:
CEPathMeter, java.io.Serializable
Enclosing class:
ShortestCEPathTest

protected static class ShortestCEPathTest.ShortPathMeter
extends java.lang.Object
implements CEPathMeter, java.io.Serializable

See Also:
Serialized Form

Field Summary
static ShortestCEPathTest.ShortPathMeter IT
           
 
Fields inherited from interface net.walend.measured.CEPathMeter
GENERICEDGE
 
Constructor Summary
private ShortestCEPathTest.ShortPathMeter()
           
 
Method Summary
 double costToCross(java.lang.Object fromNode, java.lang.Object toNode, java.lang.Object edge)
          The cost to cross an edge.
 int intCostToCross(java.lang.Object fromNode, java.lang.Object toNode, java.lang.Object edge)
          The cost to cross an edge.
 boolean negativeWeightEdges()
          Returns true if this PathMeter can return negative weight edges, false if not.
private  java.lang.Object readResolve()
           
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Field Detail

IT

public static ShortestCEPathTest.ShortPathMeter IT
Constructor Detail

ShortestCEPathTest.ShortPathMeter

private ShortestCEPathTest.ShortPathMeter()
Method Detail

readResolve

private java.lang.Object readResolve()
                              throws java.io.ObjectStreamException
java.io.ObjectStreamException

costToCross

public double costToCross(java.lang.Object fromNode,
                          java.lang.Object toNode,
                          java.lang.Object edge)
The cost to cross an edge.

Specified by:
costToCross in interface CEPathMeter
Parameters:
edge - is the edge object. In a generic-edge path or digraph, this will be GENERICEDGE.

intCostToCross

public int intCostToCross(java.lang.Object fromNode,
                          java.lang.Object toNode,
                          java.lang.Object edge)
The cost to cross an edge.

Specified by:
intCostToCross in interface CEPathMeter
Parameters:
edge - is the edge object. In a generic-edge path or digraph, this will be GENERICEDGE.

negativeWeightEdges

public boolean negativeWeightEdges()
Returns true if this PathMeter can return negative weight edges, false if not. Shortest path algorithms use this method to trigger the bellman-ford algorithm to detect negative weight cycles. If you're not sure, return true.

Specified by:
negativeWeightEdges in interface CEPathMeter


Copyright (c) 2001, 2002, David Walend