Hi Vincent, > Florent, I see your nice patches about trees which I will use in a > next future. More precisely, I would like to iterate through "unrooted > planar trees" (planar = cyclic ordering at each node).
First of all, all my patch are designed to play with rooted/recursive trees. I'm not sure they can be of any help for what you need. For me a unrooted tree is something more like a graph and a recursive object. Do you want to reuse the recursive data-structure by picking a root ? > * do your patches stable enough that I can open a new one just after them ? It depends: - the patch #8703 Combinatorial Rooted Ordered and Binary Trees is submitted and waiting for a review for quite a time (hint ! hint !). You can definitely rely on it. - the patch #11529 Rooted trees is more experimental but it should be functional. I don't think it would be a good idea to add a new patch on the file sage/combinat/rooted_tree.py it is very likely to create conflict. If you really need it, it think it would be a good idea to put the modifications in a separate patch and for me to fold those. > * does anybody have references for the problem I'm interested in ? I'm asking Gilles Schaefer which should know about that since it is very close to maps. Cheers, Florent -- You received this message because you are subscribed to the Google Groups "sage-combinat-devel" group. To post to this group, send email to sage-combinat-devel@googlegroups.com. To unsubscribe from this group, send email to sage-combinat-devel+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/sage-combinat-devel?hl=en.
