The main goal of this project is to fix the issues reported in https://trac.sagemath.org/ticket/13744 and in various tickets linked from there, e.g. https://trac.sagemath.org/ticket/17950
(that is, if one can produce a replacement for C code mentioned there, it would be great). a related sagemath ticket is https://trac.sagemath.org/ticket/11736 There is also an option to work on modular decomposition of directed graphs. While we do not mean to turn selection for GSoC into a programming contest, certainly people who can demonstrate working fast code for problems in hand would have a better chance. On Tue, Mar 7, 2017 at 9:20 PM, Mayank Agarwal <[email protected]> wrote: > Hi, I am Mayank Agarwal from National Institute of Technology > Durgapur,India. I am proficient in C++ and very interested in Graphs. > Will it be a good idea to start on this project now as there might be > other potential students already working on this ?? > > -- > You received this message because you are subscribed to a topic in the > Google Groups "sage-gsoc" group. > To unsubscribe from this topic, visit https://groups.google.com/d/ > topic/sage-gsoc/5Hml4f5b8YU/unsubscribe. > To unsubscribe from this group and all its topics, 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. > -- 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.
