Hi Nathann, On 2015-06-22, Nathann Cohen <nathann.co...@gmail.com> wrote: >> I would imagine this would be relatively efficient: >> > > Do not use that. If you want to figure out if there is a path from u to v, > compute the distance (or a shortest path) between the two.
Thank you! I thought that finding the *shortest* path would be more difficult than finding *some* path. But I guess the way paths are constructed is by increasing length... Best regards, Simon -- You received this message because you are subscribed to the Google Groups "sage-combinat-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-combinat-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-combinat-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-combinat-devel. For more options, visit https://groups.google.com/d/optout.
