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