By now, I am working in an implementation of Knuth's algorithms of
the "Stanford Graphbase" in maxima (both for personal needs and for
"fun"). I am writing everything in maxima language, so that what I
am doing might be useful for the manual or any kind of documentation
(I am now using noweb, so that I can get latex-source doc). In any
case, I am going to do the job, bc I need it. If you (CY? & al) think
it worthwhile, I can send you a tarball of everything.
BTW, I am keeping *ALL* of Knuth's conventions, so that "my" commands
produce exactly the same graphs as "his" (with the obvious change of
data structures, etc.).
I have a code which reduces singularities of plane vector fields, and
also gives the parametric equations of the separatrices (invariant
analytic curves through the singularity). It is more or less documented,
but all the above suggestions apply.
Congratulations to all for the great job!
Pedro.
--
Pedro Fortuny Ayuso -------------> www.maths.qmul.ac.uk/~pf
School of Mathematical Sciences. Queen Mary College, Univ. London
Mile End Road, London E1 4NS, UK ------> www.qmul.ac.uk
P.Fortuny@maths.qmul.ac.uk Tfn. Nr. 44 20 7882 5493