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

Week 6 Report (29th June - 5th July)

What did I get done this week?

This week focused heavily on official documentation standardization, visual layout optimization for planar graph diagrams and preparing clean pull requests for both planar algorithms.

  • Documentation Structure & Standardisation: Restructured the official Sphinx documentation for both pgr_makeBiconnectedPlanar.rst and pgr_makeMaximalPlanar.rst. Prioritised the core graph theory definitions and algorithm descriptions at the very beginning of the documentation. Standardised the “Main characteristics” sections (undirected graph, planar graph requirements, empty set returns for invalid inputs) and refined the running time mathematical notation to strictly follow :math:O(|V_G| + |E_G|)where:math:G(V_G, E_G) is the input graph.

  • Planar Diagram & Visual Layout Optimization: Redesigned and updated the visual sample graph diagrams (sampledata, line, and 5cycle diagrams) to guarantee strict two-dimensional planar representations with zero edge crossings. Positioned isolated components (such as 2-4 and 13-14) cleanly apart from the main graph structure to visually clarify multi-component behavior.

What do I plan on doing next week? (July 6th - July 12th)

  • Present the Week 6 documentation refinements and visual diagram updates to mentors for review.

  • Address any mentor review feedback or requested optimizations on the algorithm implementations, pgTAP tests, or documentation.

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]