This document is my final submission for the GSoC project Edge connectivity and edge disjoint spanning trees in digraphs for SageMath under the mentorship of David Courdert.
During the contribution period, I installed a local version of SageMath on my system and made several minor bug fixes to familiarize myself with the codebase:
- BipartiteGraph() fails to create graph from graph6 string
- canonical_label returns incorrect partite sets
Thanks to these minor contributions, I was a bit familiar with the codebase and the code submission process by the time my project started.