On Sunday, March 5, 2017 at 12:39:53 PM UTC, Shubham Singhal wrote: > > Hello, > > I was going through project ideas of SAGE for GSOC-17 and found this very > interesting project called Modular decomposition of graphs and digraphs. I > would surely like to contribute on this project as I am highly proficient > in C++ and Graph Algorithms, all thanks to serious competitive programming > from last 2 years. I have moderate experience in Python but can quickly > catch upon that too. > > Can mentors help me to get a head start on this project on what are the > contribution guidelines and how to get started with this particular project. >
Hi, in fact, there are several things you can do - one would be just to implement modular decomposition algorithms in C or in C++, encoding graphs in some meaningful way, e.g. accepting adjacency lists as input. After this is done, one would need to add a Python/Cython interface, but this is straightforward. Or you can implement everything directly in Python, say as an extra module for https://networkx.github.io/ More details on how to contribute to Sagemath may be found in http://doc.sagemath.org/html/en/developer/index.html HTH, Dmitrii > > Thanks > Shubham > NIT Kurukshetra > -- 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.
