Hi David, Thanks for the pointers! I’ll go through the developer and application guides to get a better grasp of things. I’ll also check out the graph module code and the papers you shared on *k* shortest simple paths.
If I have follow-up questions, would it be better to reach out here or somewhere else? Sincerely, Atharva On Thu, 6 Mar 2025 at 21:31, David Coudert <david.coud...@inria.fr> wrote: > 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. > > > Le 6 mars 2025 à 07:12, Atharva Dashora <atharvadash...@gmail.com> a > écrit : > > Hi > I'm Atharva, a final year CS grad from BITS Pilani. I came across the > project *"*Paths and cycles enumeration methods in graphs*"* and found it > interesting. I am eager to contribute and learn through this project, given > my strong background in graph theory and algorithms. > > I would love to understand the current state of implementation, the > challenges involved, and the best way to get started. Could you kindly > share any references, documentation, or initial steps I should take to > familiarize myself with the codebase and problem statement? I would greatly > appreciate the opportunity to discuss this further at your convenience. > > Looking forward to getting in touch with the community and contribute > > PS: > I've attached my resume for your reference > > > > -- > 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+unsubscr...@googlegroups.com. > To view this discussion visit > https://groups.google.com/d/msgid/sage-gsoc/704a1352-c660-48f1-9b67-087984afa376n%40googlegroups.com > <https://groups.google.com/d/msgid/sage-gsoc/704a1352-c660-48f1-9b67-087984afa376n%40googlegroups.com?utm_medium=email&utm_source=footer> > . > <resume DS.pdf> > > > —— > 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/ > > > -- > 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+unsubscr...@googlegroups.com. > To view this discussion visit > https://groups.google.com/d/msgid/sage-gsoc/AB5AFDE6-F234-4BB7-9C3F-2F8F539C3147%40inria.fr > <https://groups.google.com/d/msgid/sage-gsoc/AB5AFDE6-F234-4BB7-9C3F-2F8F539C3147%40inria.fr?utm_medium=email&utm_source=footer> > . > -- 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+unsubscr...@googlegroups.com. To view this discussion visit https://groups.google.com/d/msgid/sage-gsoc/CALc12qQSqfA2jKKDksAC1iZaG_M1UF_v43rTmrajedL_7%3D8z%3DA%40mail.gmail.com.
