Skip to content

Commit 0677319

Browse files
committed
Fix a typo
1 parent d66c66e commit 0677319

File tree

2 files changed

+3
-3
lines changed

2 files changed

+3
-3
lines changed

src/sage/game_theory/normal_form_game.py

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1137,7 +1137,7 @@ def _gambit_(self, as_integer=False, maximization=True):
11371137
{ "" 3, 5, 8 }
11381138
{ "" 2, 6, 4 }
11391139
}
1140-
1 2 3 4 5 6 7 8
1140+
1 2 3 4 5 6 7 8
11411141
<BLANKLINE>
11421142
"""
11431143
from decimal import Decimal

src/sage/graphs/domination.py

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -513,7 +513,7 @@ def _aux_with_rep(H, to_dom, u_next):
513513
514514
.. WARNING::
515515
516-
The same output may be output several times (up to ``H`` times).
516+
The same output may be output several times (up to `|H|` times).
517517
518518
In order to later remove duplicates, we here output pairs ``(ext, i)``
519519
where ``ext`` is the output candidate extension and ``i`` counts how
@@ -593,7 +593,7 @@ def minimal_dominating_sets(G, to_dominate=None, work_on_copy=True):
593593
- ``work_on_copy`` -- boolean (default: ``True``); whether or not to work on
594594
a copy of the input graph; if set to ``False``, the input graph will be
595595
modified (relabeled).
596-
596+
597597
OUTPUT:
598598
599599
An iterator over the inclusion-minimal sets of vertices of ``G``.

0 commit comments

Comments
 (0)