Slightly more efficient shortest paths

sagemath · Jun 21, 2015 · 3538a8f · 3538a8f
1 parent f0720af
commit 3538a8f
Showing 1 changed file with 7 additions and 2 deletions.
diff --git a/src/sage/matroids/matroid.pyx b/src/sage/matroids/matroid.pyx
@@ -5157,8 +5157,13 @@ cdef class Matroid(SageObject):
                         W.add(edge)
                         edge = edge2
                         W.remove(edge)
-                        e,f = edge[2] 
-                        path = H.shortest_path(e, f)
+                        e,f = edge[2]
+                        while path[0]!= e and path[0] != f:
+                            path.pop(0)
+                        while path[-1]!= e and path[-1] != f:
+                            path.pop(-1)
+                        if path[0] == f:
+                            path.reverse()
                         retry = True
                         break
             x = 1