Fix the performance issue in path finding #999
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
chenyukang
force-pushed
the
find-path-perf-2
branch
2 times, most recently
from
bf97dce to
b045b86
Compare
chenyukang
force-pushed
the
find-path-perf-2
branch
from
b045b86 to
8ea3ec0
Compare
chenyukang
force-pushed
the
find-path-perf-2
branch
from
328aa4b to
4e4b2bf
Compare
chenyukang
force-pushed
the
find-path-perf-2
branch
from
1ce3a1f to
dce807d
Compare
jjyr
approved these changes
Jan 5, 2026
jjyr
reviewed
Jan 5, 2026
jjyr
reviewed
Jan 5, 2026
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
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.
This PR try to reduce the call numbers of
find_path.payment_find_path_statsto track the number ofinner_find_path.inner_find_pathnow support to find the max single path for a target, so that we can avoid to do meanless searching when the result determined to be fail.midamount, try to extend it to large amount with cheaper checking, to reduce the number of invocation ofinner_find_pathwith exploring all the whole graph.