com.graphhopper.routing.weighting

Class AvoidEdgesWeighting

java.lang.Object

com.graphhopper.routing.weighting.AbstractAdjustedWeighting

com.graphhopper.routing.weighting.AvoidEdgesWeighting

All Implemented Interfaces:

Weighting

public class AvoidEdgesWeighting
extends AbstractAdjustedWeighting

Rates already used Paths worse.

Author:

Robin Boldt

Field Summary

Fields

Modifier and Type	Field and Description
protected com.carrotsearch.hppc.IntSet	visitedEdges

Fields inherited from class com.graphhopper.routing.weighting.AbstractAdjustedWeighting

superWeighting

Constructor Summary

Constructors

Constructor and Description
AvoidEdgesWeighting(Weighting superWeighting)

Method Summary

Modifier and Type	Method and Description
void	addEdges(Collection<EdgeIteratorState> edges) This method adds the specified path to this weighting which should be penalized in the calcWeight method.
double	calcWeight(EdgeIteratorState edgeState, boolean reverse, int prevOrNextEdgeId) This method calculates the weighting a certain edgeState should be associated.
double	getMinWeight(double distance) Used only for the heuristic estimation in A*
String	getName()
AvoidEdgesWeighting	setEdgePenaltyFactor(double edgePenaltyFactor)

Methods inherited from class com.graphhopper.routing.weighting.AbstractAdjustedWeighting

calcMillis, getFlagEncoder, matches, toString

Methods inherited from class java.lang.Object

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

Field Detail

visitedEdges

protected final com.carrotsearch.hppc.IntSet visitedEdges

Constructor Detail

AvoidEdgesWeighting

public AvoidEdgesWeighting(Weighting superWeighting)

Method Detail

setEdgePenaltyFactor

public AvoidEdgesWeighting setEdgePenaltyFactor(double edgePenaltyFactor)

addEdges

public void addEdges(Collection<EdgeIteratorState> edges)

This method adds the specified path to this weighting which should be penalized in the calcWeight method.

getMinWeight

public double getMinWeight(double distance)

Description copied from interface: Weighting

Used only for the heuristic estimation in A*

Returns:

minimal weight for the specified distance in meter. E.g. if you calculate the fastest way the return value is 'distance/max_velocity'

calcWeight

public double calcWeight(EdgeIteratorState edgeState,
                         boolean reverse,
                         int prevOrNextEdgeId)

Description copied from interface: Weighting

This method calculates the weighting a certain edgeState should be associated. E.g. a high value indicates that the edge should be avoided. Make sure that this method is very fast and optimized as this is called potentially millions of times for one route or a lot more for nearly any preprocessing phase.

Parameters:

edgeState - the edge for which the weight should be calculated

reverse - if the specified edge is specified in reverse direction e.g. from the reverse case of a bidirectional search.

prevOrNextEdgeId - if reverse is false this has to be the previous edgeId, if true it has to be the next edgeId in the direction from start to end.

Returns:

the calculated weight with the specified velocity has to be in the range of 0 and +Infinity. Make sure your method does not return NaN which can e.g. occur for 0/0.

getName

public String getName()