sagemathgh-38225: fix trivial typos in graphs/traversals.pyx

Fix some trivial typos, one resulting in a formatting error.

URL: sagemath#38225
Reported by: Martin Rubey
Reviewer(s): gmou3

build/pkgs/configure/checksums.ini

@@ -1,3 +1,3 @@
 tarball=configure-VERSION.tar.gz
-sha1=f3e560bbf33add8504ba9f7ba93fff9e82e3e445
-sha256=bef93be1bb978fa34cd5aaa9c041d1a97a33ff35f88c9df2f9c25e6764770c56
+sha1=8e18845c2f314a408ed292596df09e08ddfce894
+sha256=f3036ea2d805f56a75ba561073eec5b55bca8ac56c338666e2102cc351589eed

build/pkgs/configure/package-version.txt

@@ -1 +1 @@
-5c12765f7e585b58ab0cd99f7998cfa615f85247
+4883d1cb8e64b21e3723e6dcce669ab5eab39d9a

src/sage/graphs/traversals.pyx

@@ -1601,7 +1601,7 @@ def maximum_cardinality_search(G, reverse=False, tree=False, initial_vertex=None
 
     INPUT:
 
-    - ``G`` -- a Sage Graph
+    - ``G`` -- a Sage graph
 
     - ``reverse`` -- boolean (default: ``False``); whether to return the
       vertices in discovery order, or the reverse
@@ -1616,8 +1616,8 @@ def maximum_cardinality_search(G, reverse=False, tree=False, initial_vertex=None
 
     By default, return the ordering `\alpha` as a list. When ``tree`` is
     ``True``, the method returns a tuple `(\alpha, T)`, where `T` is a directed
-    tree with the same set of vertices as `G`and a directed edge from `u` to `v`
-    if `u` was the first vertex to saw `v`.
+    tree with the same set of vertices as `G` and a directed edge from `u` to `v`
+    if `u` was the first vertex to see `v`.
 
     EXAMPLES: