Inquiry About Implementing Graph Ordering Algorithms in pgRouting for GSoC Proposal

pgRouting pgrouting-dev
1

Hello Vicky, I hope you are doing well. I would like to confirm whether pgRouting still requires the implementation of the following functions from Boost Graph Library (BGL):

  1. bandwidth (Boost Doc)
  2. ith_bandwidth (Boost Doc)

If these functions are no longer needed, I am interested in contributing to pgRouting by implementing the following ordering algorithms:

  1. King Ordering (Boost Doc)
  2. Minimum Degree Ordering (Boost Doc)

These algorithms are useful for reducing matrix bandwidth and optimizing graph computations, which could enhance certain pgRouting functionalities.

If bandwidth and ith_bandwidth are still needed, I would like to prioritize their implementation. However, if they are no longer required, I am interested in contributing to pgRouting by implementing King Ordering and Minimum Degree Ordering. Would these functions be relevant to pgRouting’s roadmap? I would appreciate your guidance on whether they could be considered as part of my Google Summer of Code (GSoC) 2025 project idea.

Looking forward to your feedback.

Best regards,

Fan Wu

Wuhan University

2

Hello @wifiBlack , Thankyou! for giving me chance to choose . Is it okay if I confirm it in next 24 hr. And then just start with your proposal.

1 Like
3

Hello @wifiBlack and @Saloni-2005

The bandwidth and the ordering are interesting to be implemented into pgRouting.

Regards
Vicky

1 Like
4

OK, I look forward to your confirmation and am ready to proceed with the proposal once you decide.

5

Thank you for your guidance! :smiling_face_with_three_hearts:

6

Hello @wifiBlack Thankyou! for waiting. I will continue with “bandwidth” so you can go ahead with “king ordering”.

7

You only choose one(Boost Graph Library: Bandwidth - 1.56.0) to implement?

8

Yes.