-
-
Notifications
You must be signed in to change notification settings - Fork 376
Pgr contraction hierarchies #2867
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
Pgr contraction hierarchies #2867
Conversation
Important Review skippedAuto reviews are disabled on base/target branches other than the default branch. Please check the settings in the CodeRabbit UI or the You can disable this status message by setting the Thanks for using CodeRabbit! It's free for OSS, and your support helps us grow. If you like it, consider giving us a shout-out. 🪧 TipsChatThere are 3 ways to chat with CodeRabbit:
Note: Be mindful of the bot's finite context window. It's strongly recommended to break down tasks such as reading entire modules into smaller chunks. For a focused discussion, use review comments to chat about specific files and their changes, instead of using the PR comments. CodeRabbit Commands (Invoked using PR comments)
Other keywords and placeholders
CodeRabbit Configuration File (
|
2e56558
to
4a10b8f
Compare
8b02930
to
a9c9704
Compare
a9c9704
to
f515e3d
Compare
@coderabbitai review |
Tip For best results, initiate chat on the files or code changes. 🧩 Analysis chain🏁 Script executed:
Length of output: 74825 🏁 Script executed:
Length of output: 4521 @cvvergara I've reviewed PR #2867 and prepared a summary as requested: Summary of PR #2867 - Contraction HierarchiesThis pull request implements the Contraction Hierarchies algorithm, which is a preprocessing technique used to significantly speed up shortest path queries in large graphs like road networks. The implementation adds a new experimental function Key additions:
This is the first step toward a complete contraction hierarchies implementation, with a specialized bidirectional Dijkstra algorithm planned for a future PR. Review:The implementation is well-structured, following pgRouting's architecture patterns. It includes:
The code builds on existing contraction functionality but stands as its own implementation rather than being integrated with The functionality is correctly marked as experimental, which is appropriate for this new addition. Would you like me to dive deeper into any specific aspect of this PR? |
Closing this PR in favor of #2868 |
Changes proposed in this pull request:
@pgRouting/admins