some optimization

veerer/automaton.py

@@ -739,7 +739,7 @@ def next_seed(self):
             for back_neighbor, label in self._in_neighbors(state):
                 if self._verbosity >= 2:
                     print('[next_seed] add back_neighbor %s' % (back_neighbor,))
-                self.add_seed(back_neighbor)
+                self.add_seed(back_neighbor, setup=False)
 
     def run(self, max_size=None):
         r"""
@@ -1573,6 +1573,8 @@ def _out_neighbors(self, state, check=CHECK):
         elif kind == 'horizontal-strebel':
             for colouring in state.colourings():
                 for vt in state.veering_triangulations(colouring, HORIZONTAL, mutable=True):
+                    # TODO: this check for Delaunay condition is costly. Maybe it could
+                    # be amortized inside the function veering_triangulations?
                     if vt.is_delaunay():
                         vt.set_canonical_labels()
                         vt.set_immutable()
@@ -1613,6 +1615,8 @@ def _in_neighbors(self, state):
         elif kind == 'vertical-strebel':
             for colouring in state.colourings():
                 for vt in state.veering_triangulations(colouring, VERTICAL, mutable=True):
+                    # TODO: this check for Delaunay condition is costly. Maybe it could
+                    # be amortized inside the function veering_triangulations?
                     if vt.is_delaunay():
                         vt.set_canonical_labels()
                         vt.set_immutable()

veerer/constellation.py

@@ -960,9 +960,6 @@ def relabel(self, p, check=True):
         for l in self._data:
             perm_on_list(p, l, n)
 
-        # TODO: remove check
-        self._check()
-
     def _relabelling_from(self, start_edge):
         r"""
         Return a canonical relabelling map obtained from walking

veerer/triangulation.py

@@ -493,7 +493,6 @@ def triangles(self):
         """
         return [c for c in perm_cycles(self._fp, True, self._n) if self._data[0][c[0]] == 0]
 
-
     def boundary_faces(self):
         r"""
         Return the list of boundaries as lists of half-edges.