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.
resume DS.pdf
Description: Adobe PDF document
