com.graphhopper.routing.weighting

Class ShortestWeighting

java.lang.Object

com.graphhopper.routing.weighting.AbstractWeighting

com.graphhopper.routing.weighting.ShortestWeighting

All Implemented Interfaces:

Weighting

public class ShortestWeighting
extends AbstractWeighting

Calculates the shortest route - independent of a vehicle as the calculation is based on the distance only.

Author:

Peter Karich

Field Summary

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

flagEncoder

Constructor Summary

Constructors

Constructor and Description
ShortestWeighting(FlagEncoder flagEncoder)

Method Summary

Modifier and Type	Method and Description
double	calcWeight(EdgeIteratorState edgeState, boolean reverse, int prevOrNextEdgeId) This method calculates the weighting a certain edgeState should be associated.
double	getMinWeight(double currDistToGoal) Used only for the heuristic estimation in A*
String	getName()

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

calcMillis, equals, getFlagEncoder, hashCode, matches, toString, weightingToFileName

Methods inherited from class java.lang.Object

clone, finalize, getClass, notify, notifyAll, wait, wait, wait

Constructor Detail

ShortestWeighting

public ShortestWeighting(FlagEncoder flagEncoder)

Method Detail

getMinWeight

public double getMinWeight(double currDistToGoal)

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