org.opentripplanner.routing.spt

Class DominanceFunction.Pareto

java.lang.Object

org.opentripplanner.routing.spt.DominanceFunction

org.opentripplanner.routing.spt.DominanceFunction.Pareto

All Implemented Interfaces:

Serializable

Enclosing class:

DominanceFunction

public static class DominanceFunction.Pareto
extends DominanceFunction

In this implementation the relation is not symmetric. There are sets of mutually co-dominant states.

See Also:

Serialized Form

Nested Class Summary

Nested classes/interfaces inherited from class org.opentripplanner.routing.spt.DominanceFunction

DominanceFunction.EarliestArrival, DominanceFunction.LeastWalk, DominanceFunction.MinimumWeight, DominanceFunction.Pareto

Constructor Summary

Constructors

Constructor and Description
Pareto()

Method Summary

Modifier and Type	Method and Description
boolean	betterOrEqual(State a, State b) Return true if the first state "defeats" the second state or at least ties with it in terms of suitability.

Methods inherited from class org.opentripplanner.routing.spt.DominanceFunction

betterOrEqualAndComparable, getNewShortestPathTree

Methods inherited from class java.lang.Object

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

Constructor Detail

Pareto

public Pareto()

Method Detail

betterOrEqual

public boolean betterOrEqual(State a,
                             State b)

Description copied from class: DominanceFunction

Return true if the first state "defeats" the second state or at least ties with it in terms of suitability. In the case that they are tied, we still want to return true so that an existing state will kick out a new one. Provide this custom logic in subclasses. You would think this could be static, but in Java for some reason calling a static function will call the one on the declared type, not the runtime instance type.

Specified by:

betterOrEqual in class DominanceFunction