Hello everyone!
At Galgotias University, I’m Alay Sharma, a B.Tech student presently enrolled in the Massive Open Online Course in Geospatial Intelligence & Systems (MMGEIS Stage 3). I have a strong interest in graph algorithms, geospatial technologies, and supporting the open-source community.
I’m thrilled to suggest the following pgRouting project for GSoC 2025:
“Johnson’s Algorithm Implementation with the Boost Graph Library (BGL)”
In order to ensure high efficiency and scalability for real-world routing applications involving both positive and negative edge weights, the project aims to integrate Johnson’s Algorithm, a potent all-pairs shortest path algorithm, into pgRouting using the Boost Graph Library.
What I Have in Store:
Use Boost::Graph to implement Johnson’s algorithm in C++ while making sure it works with the architecture of pgRouting.
Create streamlined, maintainable API endpoints and use SQL interfaces to make the functionality available.
Include thorough documentation, performance benchmarks, and unit tests.
Make sure the implementation can be expanded for upcoming enhancements and optimisations (e.g., alternate heuristics or parallelism).
My intent issue #430 has already been opened, and I’m working on my complete proposal right now. Any comments or recommendations would be greatly appreciated!
Looking forward to working together, picking up new skills, and making a significant contribution to the OSGeo community and pgRouting!