-
Notifications
You must be signed in to change notification settings - Fork 1.5k
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
Add minweight and maxweight arguments to k-shortest path algorithms. #2915
Conversation
The two new arguments allow the filtering of paths that do not meet the mininum and maximum weight requirements. Added unit tests.
Set minweight and maxweight to the minimum and maximum possible float values respectively when they are not passed explicitly.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Reviewed 5 of 5 files at r1.
Reviewable status: all files reviewed, 1 unresolved discussion (waiting on @martinmr)
query/query.go, line 801 at r1 (raw file):
} if v, ok := gq.Args["depth"]; ok && (args.Alias == "shortest") {
Would make sense to move all these && args.Alias == "shortest"
to one big if condition.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Reviewable status: 3 of 5 files reviewed, 1 unresolved discussion (waiting on @manishrjain)
query/query.go, line 801 at r1 (raw file):
Previously, manishrjain (Manish R Jain) wrote…
Would make sense to move all these
&& args.Alias == "shortest"
to one big if condition.
Done.
…graph-io#2915) The two new arguments allow the filtering of paths that do not meet the mininum and maximum weight requirements. Added unit tests.
The two new arguments allow the filtering of paths that do not meet the
mininum and maximum weight requirements.
Added unit tests.
Fixes #1778
This change is