net.walend.measured
Class CEBellmanFordTest.BFPathMeter

java.lang.Object
  |
  +--net.walend.measured.CEBellmanFordTest.BFPathMeter

All Implemented Interfaces:

CEPathMeter

Enclosing class:

CEBellmanFordTest

private static final class CEBellmanFordTest.BFPathMeter

extends java.lang.Object

implements CEPathMeter

A special path meter for the Bellman Ford algorithm that wraps another path meter.

Field Summary

private CEPathMeter

wrapped

Fields inherited from interface net.walend.measured.CEPathMeter

GENERICEDGE

Constructor Summary

protected

CEBellmanFordTest.BFPathMeter(CEPathMeter wrapped)

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

Field Detail

wrapped

private CEPathMeter wrapped

Constructor Detail

CEBellmanFordTest.BFPathMeter

protected CEBellmanFordTest.BFPathMeter(CEPathMeter wrapped)

Method Detail

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