GSOC: Modular Decomposition(Undirected Graphs)
GSOC Project This post is a part of Google Summer of Code, 2017 project. I got an opportunity to develop a python module for implementing linear time complexity algorithm which computes modular decomposition of undirected graphs. The module is to be integrated in SageMath library and was developed under the guidance of my mentors David Coudert and Dmitrii Pasechnik. The implementation is based on the algorithm presented in this research paper and is the first open-source python implementation of the algorithm. There was a ticket created on Sage Trac server for integrating the module in the Sage source code. The ticket associated with the project is 23487 . The project has fixed a longstanding stopgap in Sage. public/gsoc17_t23487 is the public branch created for working on providing the modular decomposition code and here is the link to the diff for that branch. Commits made on this branch are provided at this link . Both the diff and commits are also available in the “Branch”