net.walend.measured.test
Class ShortestGEPathTest.ShortGEPathMeter
java.lang.Object
|
+--net.walend.measured.test.ShortestGEPathTest.ShortGEPathMeter
- All Implemented Interfaces:
- GEPathMeter, java.io.Serializable
- Enclosing class:
- ShortestGEPathTest
- protected static class ShortestGEPathTest.ShortGEPathMeter
- extends java.lang.Object
- implements GEPathMeter, java.io.Serializable
- See Also:
- Serialized Form
Method Summary |
double |
costToCross(java.lang.Object fromNode,
java.lang.Object toNode)
The cost to cross an edge. |
int |
intCostToCross(java.lang.Object fromNode,
java.lang.Object toNode)
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 |
IT
public static ShortestGEPathTest.ShortGEPathMeter IT
ShortestGEPathTest.ShortGEPathMeter
private ShortestGEPathTest.ShortGEPathMeter()
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)
- The cost to cross an edge.
- Specified by:
costToCross
in interface GEPathMeter
intCostToCross
public int intCostToCross(java.lang.Object fromNode,
java.lang.Object toNode)
- The cost to cross an edge.
- Specified by:
intCostToCross
in interface GEPathMeter
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 GEPathMeter
Copyright (c) 2001, 2002, David Walend