> Thank you! I thought that finding the *shortest* path would be more > difficult than finding *some* path.
It is true is you take the edge's weighting into account, but you get this more or less for free otherwise. > But I guess the way paths are > constructed is by increasing length... Indeed. And a BFS is cheap. Do you need it to be very very fast? If it is for your path algebras, then it can probably be written very low at backend level. Nathann -- 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.
