Trac #24727: Graphs, check for algorithm

Try

{{{
g = graphs.PetersenGraph()
g.is_chordal(algorithm='junk')
g.canonical_label(algorithm=0)
}}}

URL: https://trac.sagemath.org/24727
Reported by: jmantysalo
Ticket author(s): Jori Mäntysalo
Reviewer(s): David Coudert

Author: Release Manager

src/sage/graphs/generic_graph.py

@@ -13151,7 +13151,7 @@ def random_subgraph(self, p, inplace=False):
                 vertices.append(v)
         return self.subgraph(vertices=vertices, inplace=inplace)
 
-    def is_chordal(self, certificate = False, algorithm = "B"):
+    def is_chordal(self, certificate=False, algorithm="B"):
         r"""
         Tests whether the given graph is chordal.
 
@@ -13295,6 +13295,9 @@ def is_chordal(self, certificate = False, algorithm = "B"):
           Pacific J. Math 1965
           Vol. 15, number 3, pages 835--855
         """
+        if algorithm not in ['A', 'B']:
+            raise ValueError('unknown algorithm "{}"'.format(algorithm))
+
         self._scream_if_not_simple()
 
         # If the graph is not connected, we are computing the result on each component
@@ -22499,7 +22502,7 @@ class by some canonization function `c`. If `G` and `H` are graphs,
             deprecation(19517, "Verbosity-parameter is removed.")
 
         # Check parameter combinations
-        if algorithm and algorithm not in ['sage', 'bliss']:
+        if algorithm not in [None, 'sage', 'bliss']:
             raise ValueError("'algorithm' must be equal to 'bliss', 'sage', or None")
         if algorithm != 'bliss' and not return_graph:
             raise ValueError("return_graph=False can only be used with algorithm='bliss'")