On 13/01/18 14:42, Dave F wrote:
When a router traversing a way encounters a node it does a check to see if other ways are connected, If they are, it analyses the tags on those ways & decides if needs to go down one of them or continue to the next node. There's no requirement to split.
Whilst I don't know the specific algorithms used by current routers, the standard algorithms for the shortest path through a network <https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm> requires a list of nodes and edges, and creates the full tree of possible routes out from that endpoint, assigning costs to reach each node.
Whilst it might be possible to deduce edges and assign costs to the edges on the fly, that is likely to result in more processing, and mean one has to customise the standard algorithm.
On the other hand, one could argue that this is almost a case of tagging for the renderer. I'd certainly say it was a misuse of the map database.
(I suspect routers use some heuristics to avoid searching too many edges.) _______________________________________________ Talk-GB mailing list Talk-GB@openstreetmap.org https://lists.openstreetmap.org/listinfo/talk-gb
