I’m Ayush, a 3rd-year undergraduate student at IIIT Sonepat, India. I’m very interested in geospatial technologies and routing algorithms.
I have experience with C++, Python, Git, and open-source collaboration, and I’ve already started the application process by opening an issue and setting up the project locally as suggested in the contributor guide.
I’m highly motivated to contribute to pgRouting for GSoC 2026 and look forward to learning from the community and mentors while making meaningful contributions.
I am currently going through the codebase and docs. I wanted some guidance on which idea would be more useful to work on.
I have two ideas:
Betweenness centrality: A function like pgr_betweennessCentrality() to find important intersections (bottlenecks) in a road network so pgRouting can also be used for network analysis, not only routing.
Time dependent shortest path: routing where edge cost depends on departure time (traffic or rush hour), something like pgr_tdDijkstra/pgr_tdAStar.
Before going deeper into one of them. I wanted to ask which fits pgRouting better and reasonable for a GSoC scope.
@robe , I have completed my proposal for pgr_edgeBetweennessCentrality and submitted it as per instructions. Could you please take a look and share your feedback? Any review would be very helpful.
Also, I am not able to move this topic to the pgRouting Developers section as I don’t seem to have the required permission. It would be very helpful if you could move it there.
Hi! @robe , I’ve submitted my proposal via email as per the instructions. I haven’t received any feedback yet, so I wanted to kindly ask if it would be okay to share the proposal link here for review.
I would really appreciate any suggestions or feedback to help me improve it further. Thank you for your time!
