GSoC 2026 Week 3 Report: Implementation of Make Biconnected Planar and Make Maximal Planar Algorithm to pgRouting

Initiatives Google Summer of Code
1

Mohit Rawat
Github id: Mohit242-bit

Mentors: @cvvergara, @robe
Organization: OSGeo / pgRouting
OSGeo Profile: OSGeo Profile Link
Project Wiki: Github Wiki Link
Repository: Repo Link

This is my third weekly report of Official coding period for GSoC 2026

Week 3 Report (8 June - 14 June)

What did I get done this week?

This week focused on refactoring the architecture for pgr_makeBiconnectedPlanar and pgr_makeMaximalPlanar to use a shared pgRouting 3-layer process/driver structure, cleaning up files, and isolating branch scope.

  • Refactored `pgr_makeBiconnectedPlanar` and `pgr_makeMaximalPlanar` to use a unified `planar_driver` and `planar_process` framework.

  • Cleaned up the codebase by deleting obsolete, duplicate driver and process files.

  • Discussed and finalised the implementation of Makebiconnected algorithm and MakeMaximal planar algorithm implementation (disconnected components input case)

What do I plan on doing next week? (June 15th - June 21st)

  • Work on the `pgr_makeBiconnectedPlanar` and `pgr_makeMaximalPlanar` implementation for the disconnected components input case.

  • Edge Cases & Output Mapping -handle different types of edge cases and erros.

  • Write comprehensive pgTap tests: path graphs P3/P4/P5, cycle graphs, tree graphs, disconnected input.

  • Start RST documentation and docqueries .

Am I blocked on anything?

No

References:

1] Link to detailed wiki page

2] Link to github repository

3] Link to pull requests : [1] and [2]

1 Like