Hi Nathann, I do need to consider rooted, ordered trees. Thanks for the references!
Best, Rodrigo On Sunday, November 8, 2015 at 2:01:36 AM UTC-5, Nathann Cohen wrote: > > Hello Rodrigo, > > Sage has a Graph class that might help you in what you plan, but from your > message I was not able to guess if you needed 'more' than just a graph > class. > > Turns out that we are many here to deal with graph/trees, but we do so in > different ways. My trees are not rooted and not ordered, while > combinatorialists here may have something closer to what you need. Have you > taken a look at those pages? > > > http://doc.sagemath.org/html/en/reference/combinat/sage/combinat/enumerated_sets.html#trees > http://doc.sagemath.org/html/en/reference/graphs/index.html#sage-graphs > > Maybe they will tell you where exactly yuo need to look in order to > translate your code into Sage code. > > Have fuuuuuun, > > Nathann > > On Sunday, November 8, 2015 at 4:27:46 AM UTC+1, Rodrigo wrote: >> >> Hi. I would like to implement an algorithm that clips (rooted, ordered) >> trees at certain points and then reconnect them at different points. I have >> done it already using python alone, but I was hoping to do it in Sage to >> make the visualization and debugging easier. Perhaps I should even redo the >> whole thing using Sage tools from the beginning to avoid reinventing the >> wheel going forward :) Could anyone please point me to the most appropriate >> tools? Thanks! >> >> >> -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-support+unsubscr...@googlegroups.com. To post to this group, send email to sage-support@googlegroups.com. Visit this group at http://groups.google.com/group/sage-support. For more options, visit https://groups.google.com/d/optout.
