GSoC 2025 : Final Report | Implementation of Bandwidth Algorithm to pgRouting

Initiatives Google Summer of Code
1

Hello everyone,

With GSoC coming to an end, I hereby present my final report of the work I have done over the past three months. It has been an amazing experience and great learning, working with the pgRouting community and mentors. This report follows the guidelines set by Google

Title:

  • Implementation of Bandwidth Algorithm to pgRouting

Organisation:

  • pgRouting under OSGeo

Abstract:

  • This GSoC project deals with the implementation of the bandwidth algorithm in pgRouting.
  • pgr_bandwidth() : This function is used to Calculate the bandwidth of an undirected graph.

The addition that my project brought to pgRouting:

  • My project added the code, documentation (with the docqueries), and the pgTAP tests of pgr_bandwidth

The State of the Project Before GSoC:

  • Until now, bandwidth has not been implemented in pgRouting. However, from the graph metrics of the Boost Graph Library, only brandes_betweenness_centrality has been implemented in pgRouting so far.

Potential Future Work :

  • Improve the bandwidth calculation to work with more types of graphs
  • Find better ways to reduce graph bandwidth automatically
  • Create tools to help people understand how graph bandwidth works
  • Make the algorithm faster and more efficient for large networks
  • Add more ways to visualize and analyze graph structure

Links:

Acknowledgments:

I am deeply grateful to the pgRouting and OSGeo community for being so welcoming and supportive throughout my GSoC journey. The encouragement, collaborative spirit, and openness to share knowledge created an environment where I could learn, contribute, and grow with confidence. The sense of belonging within the community made this experience truly enjoyable and inspiring.