net.walend.measured
Class SimpleGEPathMeter

java.lang.Object
  |
  +--net.walend.measured.SimpleGEPathMeter

All Implemented Interfaces:

GEPathMeter, java.io.Serializable

public class SimpleGEPathMeter

extends java.lang.Object

implements GEPathMeter, java.io.Serializable

This simple path meter returns 1 for the cost to cross an edge and 0 for everything else.

Author:

David Walend dfw1@cornell.edu

See Also:

Serialized Form

Constructor Summary

SimpleGEPathMeter()

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() Since the cost to cross any edge is 0 or 1, this always returns false.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

SimpleGEPathMeter

public SimpleGEPathMeter()

Method Detail

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()

Since the cost to cross any edge is 0 or 1, this always returns false.

Returns true if this GEPathMeter 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