GSoC 2026 Week 7 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 seventh weekly report of Official coding period for GSoC 2026

Week 7 Report (6th July - 12th July)

What did I get done this week?

This week I focused on simplifying and cleaning up our test suites based on the topological nature of our new functions.

  • pgTAP Simplification: Removed redundant UPDATE statements (like cost = sign(cost)) from the edge_cases.pg files for both makeBiconnectedPlanar and makeMaximalPlanar. Since these algorithms are strictly topological and do not consider edge weights, preparing costs was unnecessary.

  • Test Code Cleanup: Removed unused PREPARE statements and inlined queries in the test files to make the testing structure leaner and easier to maintain.

What do I plan on doing next week? (13th July - 19th July)

Next week will be focused on addressing specific documentation feedback from mentors before opening new pull requests:

  • Planar Family Documentation: Create the planar-family.rst index page. Since pgr_isPlanar was previously the only function, it lacked a family page. I will group all planar functions (pgr_isPlanar, pgr_makeBiconnectedPlanar, and pgr_makeMaximalPlanar) and ensure they appear correctly in the Table of Contents and version breadcrumbs.

  • Graphviz Visual Redraw: Redraw the maximal_planar_sampledata diagram using Graphviz to explicitly reposition nodes so that zero edges cross, providing a true planar embedding visualization for the documentation.

  • Open Official PRs: Create the final pull requests for the biconnected and maximal planar branches.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]