Interest in the ""Paths and Cycles Enumeration Methods in Graphs" project for GSoC 2025

[Pradyumna Prahas]

Hello , I am R Pradyumna Prahas, a third-year undergraduate student from India.

I am Interested in Contributing to the project "Paths and Cycles Enumeration Methods in Graphs" I have studied Graph Theory ,Data Structures and algorithm, and Various Graphs Algorithms like Dijkstra, Floyd warshall, bellaman ford, tarjan, kosaraju's in my college. I also have experience in coding using Java,C++ and Python and across various other platforms like leetcode, codeforce, codechef. I would like to know more about the project. It would be really helpful if you could provide me on some tips to get started.

Best regards,

R Pradyumna Prahas

[david....@gmail.com]

Thank you for your interest in this project.

Recall that the short description gives ideas for the project and you, the potential contributor, are expected to turn the ideas into a full proposal.

It is strongly suggested to start reading the developper guide of Sagemath, and the application guide https://wiki.sagemath.org/GSoC/Contributors 

To get the current state of implementation, you can look at the code of the graph module. You will find methods for the enumeration of simple paths, the k shortest simple paths, cycles, etc.

For algorithms, you can read for instance recent papers on the k shortest simple paths like

- https://dl.acm.org/doi/pdf/10.1145/3626567  and references there in

- https://link.springer.com/article/10.1007/s12532-025-00276-0 

Sincerely,

David.