modify the test case of shortestspaths3 to make its results determini… #4431
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
…stic, given that match with shortestPath() may return one shortest path, not all of them.
What type of PR is this?
What problem(s) does this PR solve?
Issue(s) number:
#4424
Description:
The original test case
may return only one shortestPath() between the src and the end, not all of them. The exact path returned depends on the state of the database. It's not deterministic. So it happens that this test case fails with an expected result.
The behavior of shortestPath() is to be discussed. Maybe it should return all shortest paths with the same shortest length. Or, maybe an allshortestpath() should be added?
For the time being, I recommend modifying this query to pass this test case.
How do you solve it?
Modified the return values in the query to have deterministic results.
Special notes for your reviewer, ex. impact of this fix, design document, etc:
Checklist:
Tests:
Affects:
Release notes:
Please confirm whether to be reflected in release notes and how to describe: