On Thu, May 7, 2020 at 11:38 AM Vincent Delecroix <[email protected]> wrote: > > Le 06/05/2020 à 00:10, Mauro Weber a écrit : > > for G in I: > > > > if G.is_tree(): > > If you want to iterate over trees don't filter them by generating all > graphs. This is a huge waste of time > > # graphs(n) "=" 2^(n^2) / n! > # trees(n) "=" Catalan(n) > > Trees are easy to generate up to isomorphism.
specifically, see http://doc.sagemath.org/html/en/reference/graphs/sage/graphs/trees.html > > Vincent > > -- > 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 [email protected]. > To view this discussion on the web visit > https://groups.google.com/d/msgid/sage-support/f2feda5e-4f55-6c05-1d55-9ba66d480f6f%40gmail.com. -- 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 [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/sage-support/CAAWYfq05KhuZNeLG2s4orut4Ly9zPjvkAdExPJHqws9L1%2B5EWQ%40mail.gmail.com.
