@@ -30,7 +30,7 @@ cdef extern from "planarity/graph.h":
30
30
cdef int gp_SortVertices(graphP theGraph)
31
31
32
32
33
- def is_planar (g , kuratowski = False , set_pos = False , set_embedding = False , circular = None ):
33
+ def is_planar (g , kuratowski = False , set_pos = False , set_embedding = False ):
34
34
r """
35
35
Check whether ``g`` is planar using Boyer's planarity algorithm.
36
36
@@ -55,8 +55,6 @@ def is_planar(g, kuratowski=False, set_pos=False, set_embedding=False, circular=
55
55
combinatorial embedding returned ( see
56
56
:meth:`~sage. graphs. generic_graph. GenericGraph. get_embedding`)
57
57
58
- - ``circular`` -- deprecated argument
59
-
60
58
EXAMPLES::
61
59
62
60
sage: G = graphs. DodecahedralGraph( )
@@ -98,10 +96,6 @@ def is_planar(g, kuratowski=False, set_pos=False, set_embedding=False, circular=
98
96
.... : assert ( hasattr( G, '_pos') and G. _pos is not None) == set_pos, ( set_embedding, set_pos)
99
97
100
98
"""
101
- if circular is not None :
102
- from sage.misc.superseded import deprecation
103
- deprecation(33759 , ' the circular argument of is_planar is deprecated and has no effect' )
104
-
105
99
if set_pos and not g.is_connected():
106
100
raise ValueError (" is_planar() cannot set vertex positions for a disconnected graph" )
107
101
0 commit comments