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
somewhe
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
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 u
