Problem
Actually, the Cost Matrix functions does not support pick the n shortests routes, the only option is go down one level and use for example one to multi.
Improvement
Add a param to be able to choose the n min paths!
Alternatives
Is possible, to run this collect all the n routes using the n to multi functions, but there is some tricky things about it, actually for bidirectional case, calc the route from a to b, is the same as b to a, due to this, the matrix cost can handle better performance, while if we run one by one the one to multi this improvement is not done.
Hi all!
Problem Actually, the Cost Matrix functions does not support pick the n shortests routes, the only option is go down one level and use for example one to multi.
Improvement Add a param to be able to choose the n min paths!
Alternatives Is possible, to run this collect all the n routes using the n to multi functions, but there is some tricky things about it, actually for bidirectional case, calc the route from a to b, is the same as b to a, due to this, the matrix cost can handle better performance, while if we run one by one the one to multi this improvement is not done.
Thx!