Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Support pick n shortests routes in Cost Matrix #2509

Open
latot opened this issue May 5, 2023 · 0 comments
Open

Support pick n shortests routes in Cost Matrix #2509

latot opened this issue May 5, 2023 · 0 comments

Comments

@latot
Copy link

latot commented May 5, 2023

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!

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant