Hi Nicolas, On 2015-06-20, Nicolas M. Thiery <nicolas.thi...@u-psud.fr> wrote: > - search for a path from one of the out neighbors of v to v
Sure, but how? In fact I was looking for a method of digraphs telling me whether there is a path from vertex v to vertex w, but I couldn't find one. "w in D.connected_component_containing_vertex(v)" doesn't work, as the connected component doesn't take into account the orientations. "w in D.strongly_connected_component_containing_vertex(v)" doesn't work, as that would test if v and w belong to a CYCLE (not just a path). Using D.shortest_path probably isn't efficient, as we are looking for the existence of *some* path and do not need the *shortest* one. 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.
