Hii @cvvergara ,
Thank you for letting me know. That makes sense I’ll focus on completing and refining my GSoC application during the application period.
I understand that PR 3078 won’t be considered for the proposal and I won’t include it in my application links.
Thanks again for the guidance.
Best regards,
Mohit
Hello pgRouting team ,
I have completed my proposal and have sent it as per your instructions.
I would greatly appreciate any feedback or suggestions if you happen to review it.
Thank you,
Mohit Rawat
Hii @cvvergara , @robe
I have a doubt regarding the GSoC 2026 Ideas page requirements for C++ Boost graph algorithms.
The Wiki states: “choose one algorithm (175 hours) or two algorithms (350 hours) that are not yet implemented”.
In my proposal, my main focus is implementing a Planar Graph pipeline with two algorithms (make_biconnected_planar and make_maximal_planar). However, I also wanted to propose find_odd_cycle as my Phase 1 deliverable because it fits perfectly as a natural, low-risk extension to the already existing pgr_bipartite (they share the same Boost header and graph concepts).
Is the 2 algorithms limit an absolute strict maximum? Would it be acceptable to propose these 3 algorithms for a 350-hour project because find_odd_cycle requires very little new infrastructure and i am already done with proposal final draft including all three algorithms, or should I strictly scope down my proposal to exactly 2 algorithms to strictly follow the guidelines?
Thank you!