Interest in GSoC Project – Paths and Cycles Enumeration Methods in Graphs

[Rahul Katarki]

Hi,

I'm Rahul R Katarki, a sophomore at IIT BHU with a strong background in algorithms and graph theory. I participate in competitive programming contests under the handle conjectureguy. I came across the project "Paths and cycles enumeration methods in graphs" and found it fascinating, especially given my prior experience with SageMath.

Looking forward to contributing and engaging with the community!

[David Coudert]

Thank you for your interest in this project.

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.

--
You received this message because you are subscribed to the Google Groups "sage-gsoc" group.
To unsubscribe from this group and stop receiving emails from it, send an email to sage-gsoc+...@googlegroups.com.
To view this discussion visit https://groups.google.com/d/msgid/sage-gsoc/010753b4-6b1c-48a1-aedf-36a70d7be078n%40googlegroups.com.

——
David Coudert
Equipe-Projet COATI
Centre Inria d’Université Côte d'Azur
Université Côte d’Azur, Inria, CNRS, I3S, France
http://www-sop.inria.fr/members/David.Coudert/