From 530b27d6b0ae15f21fa73a3f04f9a26dbe8d65ab Mon Sep 17 00:00:00 2001 From: Martin Rubey Date: Sat, 15 Jun 2024 22:27:28 +0200 Subject: [PATCH] fix trivial typos --- src/sage/graphs/traversals.pyx | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/src/sage/graphs/traversals.pyx b/src/sage/graphs/traversals.pyx index 13fc1c2775a..2ac43921dde 100644 --- a/src/sage/graphs/traversals.pyx +++ b/src/sage/graphs/traversals.pyx @@ -1593,7 +1593,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 @@ -1608,8 +1608,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: