Computes all tracks between a set of `entries` locations and a set of `exits` locations

Returns any track between one of the entries and one of the exits, i.e. any track that can be reached from an entry before reaching an exit. To prevent a missing exit to cause the graph traversal to never stop exploring, the exploration stops when a maximum distance is reached and no exit has been found.