Ticket #10905: trac_10905-doctests.patch

sage/graphs/base/c_graph.pyx

@@ -3086 +3086 @@
         sage: dist, path = all_pairs_shortest_path_BFS(g)
         sage: all( dist[u][v] == g.distance(u,v) for u in g for v in g )
         True
+
+    TESTS:
+
+    Too large graphs::
+
+        sage: all_pairs_shortest_path_BFS(Graph(65536))
+        Traceback (most recent call last):
+        ...
+        ValueError: The graph backend contains more than 65535 nodes
+
     """
     from sage.rings.infinity import Infinity
 
@@ -3095 +3105 @@
     cdef int n = max(vertices)+1
 
     if n > <unsigned short> -1:
-        raise ValueError("The graph backend contains more than "+(<unsigned short> -1)+" nodes")
+        raise ValueError("The graph backend contains more than "+str(<unsigned short> -1)+" nodes")
 
     # The vertices which have already been visited
     cdef bitset_t seen

sage/graphs/generic_graph.py

@@ -11063 +11063 @@
             ...     p.insert(0,path[u][p[0]])
             sage: len(p) == dist[u][v] + 2
             True
+
+        TESTS:
+
+        Wrong name for ``algorithm``::
+
+            sage: g.shortest_path_all_pairs(algorithm="Bob")
+            Traceback (most recent call last):
+            ...
+            ValueError: The algorithm keyword can only be set to "auto", "BFS", "Floyd-Warshall-Python" or "Floyd-Warshall-Cython"
         """
         if default_weight != 1:
             by_weight = True
@@ -11085 +11094 @@
             raise ValueError("The algorithm keyword can only be set to "+
                              "\"auto\","+
                              " \"BFS\", "+
-                             "\"Floyd-Warshall-Cython\" or "+
+                             "\"Floyd-Warshall-Python\" or "+
                              "\"Floyd-Warshall-Cython\"")
 
         from sage.rings.infinity import Infinity