Package com.graphhopper.routing

Interface EdgeToEdgeRoutingAlgorithm

All Superinterfaces:

RoutingAlgorithm

All Known Implementing Classes:

AbstractBidirAlgo, AbstractBidirCHAlgo, AbstractBidirectionEdgeCHNoSOD, AbstractNonCHBidirAlgo, AlternativeRoute, AlternativeRouteCH, AlternativeRouteEdgeCH, AStar, AStarBidirection, AStarBidirectionCH, AStarBidirectionEdgeCHNoSOD, DijkstraBidirectionCH, DijkstraBidirectionCHNoSOD, DijkstraBidirectionEdgeCHNoSOD, DijkstraBidirectionRef

public interface EdgeToEdgeRoutingAlgorithm
extends RoutingAlgorithm

Method Summary

Modifier and Type	Method	Description
Path	calcPath(int from, int to, int fromOutEdge, int toInEdge)	like RoutingAlgorithm.calcPath(int, int), but this method also allows to strictly restrict the edge the path will begin with and the edge it will end with.

Methods inherited from interface com.graphhopper.routing.RoutingAlgorithm

calcPath, calcPaths, getName, getVisitedNodes, setMaxVisitedNodes, setTimeoutMillis

Method Details

calcPath

Path calcPath(int from,
 int to,
 int fromOutEdge,
 int toInEdge)

like RoutingAlgorithm.calcPath(int, int), but this method also allows to strictly restrict the edge the path will begin with and the edge it will end with.

Parameters:

fromOutEdge - the edge id of the first edge of the path. using EdgeIterator.ANY_EDGE means not enforcing the first edge of the path

toInEdge - the edge id of the last edge of the path. using EdgeIterator.ANY_EDGE means not enforcing the last edge of the path