N
 the node classE
 the edge classpublic interface ILcdComplexEdgeValueFunction<N,E> extends ILcdEdgeValueFunction<N,E>
A typical example is a turn restriction on a road: the individual traversal cost of the two roads involved in a turn is their length, while the sequence of the two roads has cost Double.POSITIVE_INFINITY (prohibited), instead of the sum of the two roads lengths.
This interface allows algorithms and preprocessors to quickly retrieve all special edge sequences, without having to test every single combination of edges.
Modifier and Type  Method and Description 

java.util.List<ILcdRoute<N,E>> 
getComplexEdgeSequences(ILcdGraph<N,E> aGraph,
E aEdge)
Returns the list with all routes for which the cost of adding the specified edge
is different from the edge value of that edge itself.

computeEdgeValue, getOrder
java.util.List<ILcdRoute<N,E>> getComplexEdgeSequences(ILcdGraph<N,E> aGraph, E aEdge)
A typical example is a turn restriction on a road: if it is not allowed to drive into a road B coming from a road A, this function should return a List containing a single route with road B, if A is the specified edge (and possibly other routes if it also disallowed to drive into A coming from other roads). If the turn restriction also applies in the other direction, a List containing a single route with road A should be returned if B is the specified edge.
aGraph
 the graph the edge is part of.aEdge
 the edge for which to return special edge sequences.