Hello everyone, help with the implementation of the following task is needed.
There are Point nodes containing coordinates (lat, lng). There is a bidirectional relationship (from point A to B and from point B to A) DIRECTIONS between each node, which contains the distance property (distance of pedestrian route in meters). Thus, we have a complete graph - Complete graph - Wikipedia. We know point A from which the tourist will start the route. It is necessary to find the first route that will pass through N nodes and its length should not exceed T meters.
Please advise which strategy/algorithm to use for route search?
Thanks for your time
Hi @mfiyalka,
When you say the first route that will pass through N nodes and not exceed T meters, are you asking for the shortest route that will pass through at least N nodes?
A tourist starts a journey at A. We can find all their journeys that will be less than T meters and include exactly N nodes. Do you want all of those journeys as part of the result, or just one of them?
Best wishes,
Nathan