KShortest paths #3170
Merged
KShortest paths #3170
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
andrejtonev
added
feature
Josipmrden
reviewed
Aug 7, 2025
andrejtonev
force-pushed
the
all_paths_asc
branch
from
2f62522 to
26078a2
Compare
Exists early if hops limit reached Fix: hops counting (in summary) Early break if upport limit reached while expanding Fix: Returns empty set if vertices are null or same start and end
Josipmrden
changed the title
Josipmrden
reviewed
Aug 9, 2025
Contributor
Josipmrden
left a comment
Josipmrden
left a comment
There was a problem hiding this comment.
Something seems off with the number of hops traversed (maybe it's exponential execution, at least at first glance). + it would be good to add the number of paths inside the relationship kshortest brackets, something like [ *kShortest 50]
andrejtonev
force-pushed
the
all_paths_asc
branch
from
2e48ea1 to
0f02fa8
Compare
andrejtonev
removed
CI -build=coverage -test=core
andrejtonev
removed
the
CI -build=release -test=stress
andrejtonev
force-pushed
the
all_paths_asc
branch
from
6762c07 to
c678a96
Compare
|
Josipmrden
approved these changes
Aug 11, 2025
github-merge-queue
bot
removed this pull request from the merge queue due to failed status checks
81 tasks
Contributor
Author
Tracking
Standard development
CI Testing Labels
Documentation checklist
|
11 tasks
as51340
pushed a commit
that referenced
this pull request
Oct 24, 2025
New type of variable expand (KShortest) `(n1)-[*KShortest]->(n2)` The current implementation supports only search between two predefined nodes (not really an expand operator). The user needs to capture these nodes via a WITH n1, n2 clause. The reason is that we first find the shortest path and then slowly expand the search to other shortest paths, returning the shortest paths first. Implementation supports path length filtering, but does not support user defined node/edge filtering. Transaction aborts, fine-grain access control and hops limit are also supported. Added feature: limit number of results via a variable inside the edge expression `-[*KShortest lb..ub | n]->`
19 tasks
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
New type of variable expand (KShortest)
(n1)-[*KShortest]->(n2)The current implementation supports only search between two predefined nodes (not really an expand operator).
The user needs to capture these nodes via a WITH n1, n2 clause.
The reason is that we first find the shortest path and then slowly expand the search to other shortest paths, returning the shortest paths first.
Implementation supports path length filtering, but does not support user defined node/edge filtering.
Transaction aborts, fine-grain access control and hops limit are also supported.
Added feature: limit number of results via a variable inside the edge expression
-[*KShortest lb..ub | n]->