Hello, I'm searching for an routing algorithm who can handle this two properties:
1. the edge weight function c(E) of the edge E depends on the costs of the predecessor edges. A* for example, can't handle this, because it connects existings paths without updating the successors. If the path previous to an edge changes and the edge is already expanded the costs of the edge and all successors will also change. 2. the edge weight function c(E) of the node N depends on the successor edge. For example: E_1 and E_2 are neighbour edges of E. c(E) to E_1 must be not equal to c(E) to E_2 I hope somebody can give me an advice, thanks Stefan _______________________________________________ Routing mailing list [email protected] http://lists.openstreetmap.org/listinfo/routing
