Skip to content

Commit

Permalink
Trac #28655: Fix typos in the method 'is_combinatorially_isomorphic' …
Browse files Browse the repository at this point in the history
…of Polyhedron

Fixing two typos in the method `is_combinatorially_isomorphic` of the
class `Polyhedron`

URL: https://trac.sagemath.org/28655
Reported by: gh-LaisRast
Ticket author(s): Laith Rastanawi
Reviewer(s): Frédéric Chapoton
  • Loading branch information
Release Manager committed Oct 26, 2019
2 parents e7d08d3 + b9b38dd commit fdd8a95
Showing 1 changed file with 2 additions and 2 deletions.
4 changes: 2 additions & 2 deletions src/sage/geometry/polyhedron/base.py
Original file line number Diff line number Diff line change
Expand Up @@ -7765,7 +7765,7 @@ def is_combinatorially_isomorphic(self, other, algorithm='bipartite_graph'):
Return whether the polyhedron is combinatorially isomorphic to another polyhedron.
We only consider bounded polyhedra. By definition, they are
combinatorially isomorphic if their faces lattices are isomorphic.
combinatorially isomorphic if their face lattices are isomorphic.
INPUT:
Expand Down Expand Up @@ -7877,7 +7877,7 @@ def is_combinatorially_isomorphic(self, other, algorithm='bipartite_graph'):
assert algorithm in ['bipartite_graph', 'face_lattice'], "`algorithm` must be 'bipartite graph' or 'face_lattice'"

# For speed, we check if the polyhedra have the same number of facets and vertices.
# This is faster then building the bipartite graphs first and
# This is faster than building the bipartite graphs first and
# then check that they won't be isomorphic.
if self.n_vertices() != other.n_vertices() or self.n_facets() != other.n_facets():
return False
Expand Down

0 comments on commit fdd8a95

Please sign in to comment.