Hello everyone!
I wanted to share that I’ve officially submitted my proposal for “Implementing Johnson’s Algorithm in pgRouting using Boost Graph Library” for GSoC 2025.
Over the last few days, I’ve been reviewing the source of pgr_dijkstra and pgr_bellmanFord, and sketching out some early integration tests for edge parsing and dummy vertex logic in Johnson’s algorithm. I’d love to hear any feedback from mentors or contributors — especially on how best to align with pgRouting’s conventions for SQL wrappers and error handling.
Also, if there are any datasets or test cases you’d like me to try Johnson’s implementation on, I’d be happy to experiment and share results.
Looking forward to refining the idea further with your input!
Thanks again,
Alay Sharma
Hi @cvvergara,
Just one week left until April 29, and I wanted to share a quick final update and express my gratitude again for the opportunity to contribute to pgRouting.
Since submitting my proposal, I’ve continued preparing for the project by building a dedicated repository (pgr_johnson-dev) where I’m prototyping edge handling and graph structure modules. It’s public here: GitHub - mrvenom17/pgr_johnson-dev
Along with that, I’ve structured my devlog and timeline tracker to ensure I’m aligned with pgRouting conventions and can execute quickly if selected.
If there’s anything I’ve missed or you’d like adjusted in the proposal or plan, I’d be very happy to hear your thoughts.
Thanks again for the opportunity — looking forward to learning more and contributing to pgRouting in a meaningful way.
Warm regards,
Alay Sharma
GitHub: mrvenom17