-
Notifications
You must be signed in to change notification settings - Fork 104
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
Parallel weighted shortest path #4699
Conversation
5997112
to
a155267
Compare
9b54987
to
1986f13
Compare
Benchmark ResultMaster commit hash:
|
05acdfa
to
1f1ffdc
Compare
1f1ffdc
to
edf9b5f
Compare
Benchmark ResultMaster commit hash:
|
Codecov ReportAttention: Patch coverage is
Additional details and impacted files@@ Coverage Diff @@
## master #4699 +/- ##
==========================================
- Coverage 86.33% 86.31% -0.03%
==========================================
Files 1391 1392 +1
Lines 59634 59811 +177
Branches 7328 7349 +21
==========================================
+ Hits 51483 51623 +140
- Misses 7987 8023 +36
- Partials 164 165 +1 ☔ View full report in Codecov by Sentry. |
Description
This PR implements the initial version of bellman-ford parallel weighted shortest path. The current version only tracks total weight and dst nodes. The grammar is
[* WSHORTEST (cost)]
. We only support edge property as weight but not general expression. All numerical types except int128 & int128-backed decimal are supported.This PR contains a refactor that removes DestinationOutput(Writer) and let SingleShortestPath & AllShortestPath creating their own ones. This creates a bit of code duplication but the previous inheritance is killing me and I don't think it's actually maintainable for the long term. I'll add more PRs to get rid of this Output & OutputWriter design.
There will be following PRs that supports
Fixes # (issue)
Contributor agreement