Hello, On Fri, Mar 16, 2012 at 2:06 PM, Aleksandar Makelov <[email protected]> wrote: > > I've been dealing with sympy for a couple of weeks now and was > wondering whether it'd be a good idea for GSoC to implement some more > complicated combinatorial functionality (e.g. graph algorithms, > generating functions, recurrence relations, operations on sets,...) ?
I'd recommend that you take a look at https://github.com/sympy/sympy/wiki/GSoC-2012-Ideas . Some of your suggestions seem to be related to what is listed on that page. Note, though, that graph theory is out of scope of SymPy, mainly because graphs are already implemented in a couple other Python libraries (e.g. NetworkX: http://networkx.lanl.gov/). Sorry, I cannot find the proper source to cite; but trust me, Aaron told me that about a month ago :-) > Also, I'm currently working on several little functions for > computation of the Galois group of quadratic/cubic/quartic > polynomials; I'll probably send the code in a couple of days. Maybe > I'll be able to develop some GSoC-like ideas in this direction > (abstract algebra) as well. I suppose that your contributions will be welcome :-) Sergiu -- You received this message because you are subscribed to the Google Groups "sympy" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/sympy?hl=en.
