details

Author: fchapoton

src/sage/combinat/posets/posets.py

@@ -8936,7 +8936,7 @@ def __iter__(self):
 
         .. NOTE::
 
-            This uses the DiGraph iterator as a backend to construct
+            This uses an iterator from ``nauty`` as a backend to construct
             transitively-reduced, acyclic digraphs.
 
         EXAMPLES::
@@ -8945,8 +8945,8 @@ def __iter__(self):
             sage: list(P)
             [Finite poset containing 2 elements, Finite poset containing 2 elements]
         """
-        from sage.graphs.digraph_generators import DiGraphGenerators as DG
-        for dig in DG().nauty_posetg(f"{self._n} o"):
+        from sage.graphs.digraph_generators import DiGraphGenerators
+        for dig in DiGraphGenerators().nauty_posetg(f"{self._n} o"):
             # We need to relabel the digraph since range(self._n) must be a linear
             # extension. Too bad we need to compute this again. TODO: Fix this.
             label_dict = dict(zip(dig.topological_sort(), range(dig.order())))