Dear Rajat Mittal, A good way to get started in preparing for GSoC is to start making (little) contributions to Sage. Please see this guide for more information. http://doc.sagemath.org/html/en/faq/faq-contribute.html
Concerning Yen's algorithm, observe that it also uses a heap of possible extensions. Before starting with Yen's algorithm (or it's improved version), the first step is to implement Cython versions for enumerating all (simple) paths and cycles in (un)weighted (di)graphs all (simple). Best, David Le dimanche 3 mars 2019 10:31:15 UTC+1, [email protected] a écrit : > > Hello > > > > I'm Rajat Mittal currently in my fourth year of five year Dual Degree > (B.Tech + M.Tech) Mathematics and Computing course at IIT-BHU, India. I'm > currently working on my Master’s thesis project. The domain of my project > is Graph Theory and its applications. Hence, I am quite familiar with the > *Graph > Theory* and proficient in Python and C++. I have been coding in Python > and C++ for around 4 years. I find the project on graph module *Enumeration > of Paths* quite interesting and am willing to complete the tasks > involved. I have setup the Sage environment and in the process of going > through the code base of the Graph Module of SageMath. I also have > experience in optimizing the Python Code using Cython as I have done this > in my previous internships. Should I start by implementing the *Yen’s > algorithm* for simple paths? As its time complexity is much lesser than > the current version which sage is using in all_simple_paths > method(start,end) in which it is trying all possible extensions of paths > and putting them in a heap. > > > > > Thanks > > Rajat Mittal > -- 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 [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/sage-gsoc. For more options, visit https://groups.google.com/d/optout.
