Interest in GSoC Project - Paths and Cycles Enumeration Methods in Graphs"

[Gayan Kaushalya Kumarasekara]

Hi,

I'm Gayan Kumarasekara. I'm a third year undergraduate student at University of Moratuwa, Sri Lanka. I am interested in contributing to the project "Paths and Cycles Enumeration Methods in Graphs". I have studied Graph Theory and Data Structures and algorithm in my university. I also have experience in coding using Python. 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,

Gayan

[David Coudert]

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.

--
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/1cb0f21b-fda1-4cde-9ebc-b9e0c0a0795an%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/