On Monday, March 6, 2017 at 8:59:40 PM UTC, Dima Pasechnik wrote: > > Hi there, > as there are several people willing to contribute to this particular > project, instead of answering > separately to everybody: here is how I see it. > > 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 > PS. my homepage is here: http://users.ox.ac.uk/~coml0531/ -- 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.
