Showing Interest in Paths and cycles enumeration methods in graphs project

[Adham Elsaady]

Hello,

 My name is Adham, and I am from Egypt. I am excited to express my interest in contributing to this project -Paths and cycles enumeration methods in graphs project- and becoming an active member of the community.

As this will be my first contribution, I would greatly appreciate it if you could suggest a beginner-friendly issue to help me get started. I am eager to learn, collaborate, and make a meaningful contribution.

Looking forward to your guidance.

Best regards.

[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.