net.walend.measured.test
Class TestPathMeter
java.lang.Object
|
+--net.walend.measured.test.TestPathMeter
- All Implemented Interfaces:
- CEPathMeter
- public class TestPathMeter
- extends java.lang.Object
- implements CEPathMeter
This simple path meter returns 59 to cross an edge.
- Author:
- David Walend dfw1@cornell.edu
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. |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
TestPathMeter
public TestPathMeter()
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