Hi list how can i add a new edge (a->b) to a given graph G (n.n. connected), just in the case that there is no path (a -> ... -> b) before?
all i found is the all_path(a,b) method wich tooks very long in my case and generates a huge overhead. greatz Johanens -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
