This series of 3 books probably contains everything of the graph theory available in Sage for the moment. It also certainly contains things that I would like to implement in the future like matroids, as they are used to prove a good share of the theorems presented.
Concerning the LP-related patches in Sage, though, I assure you they do not need any background in optimization or Linear Programming to be understood ( or reviewed ) : I just use a linear program "solver", which means that at some point I express a system of equations which are directly sent to a solver.... If I was able to re-write a math problem as a polynomial equation of degree 2^2^2 then ask a solver to give me the answers, I wouldn't need any knowledge of the solver's algorithm to check everything is good ( as long as you trust the solver's algorithm, which is beyond reasonable doubt in this case ). If you are interested in something more specific, just tell me ! Nathann -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel-unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
