html/en/reference/algebras/sage/algebras/lie_algebras/bgg_dual_module.html
diff --git a/html/en/reference/algebras/sage/algebras/lie_algebras/bgg_dual_module.html b/html/en/reference/algebras/sage/algebras/lie_algebras/bgg_dual_module.html
index 72161df..dfd67b0 100644
--- a/html/en/reference/algebras/sage/algebras/lie_algebras/bgg_dual_module.html
+++ b/html/en/reference/algebras/sage/algebras/lie_algebras/bgg_dual_module.html@@ -552,15 +552,16 @@ to <span class="math notranslate nohighlight">\(b\)</span> as <span class="math
<span class="gp">sage:</span> <span class="n">M</span> <span class="o">=</span> <span class="n">g</span><span class="o">.</span><span class="n">verma_module</span><span class="p">(</span><span class="n">La</span><span class="p">[</span><span class="mi">1</span><span class="p">]</span> <span class="o">+</span> <span class="n">La</span><span class="p">[</span><span class="mi">4</span><span class="p">]</span> <span class="o">-</span> <span class="mi">1</span><span class="o">/</span><span class="mi">3</span><span class="o">*</span><span class="n">La</span><span class="p">[</span><span class="mi">5</span><span class="p">])</span>
<span class="gp">sage:</span> <span class="n">Mc</span> <span class="o">=</span> <span class="n">M</span><span class="o">.</span><span class="n">dual</span><span class="p">()</span>
<span class="gp">sage:</span> <span class="n">elt</span> <span class="o">=</span> <span class="n">Mc</span><span class="o">.</span><span class="n">an_element</span><span class="p">();</span> <span class="n">elt</span>
-<span class="go">f[-alpha[5]]^2*f[-alpha[4]]^2*f[-alpha[3]]^3*v[Lambda[1] + Lambda[4] - 1/3*Lambda[5]]^*</span>
-<span class="go"> + 2*f[-alpha[5]]*v[Lambda[1] + Lambda[4] - 1/3*Lambda[5]]^*</span>
-<span class="go"> + 3*f[-alpha[4]]*v[Lambda[1] + Lambda[4] - 1/3*Lambda[5]]^*</span>
-<span class="go"> + v[Lambda[1] + Lambda[4] - 1/3*Lambda[5]]^*</span>
+<span class="go">f[-alpha[2]]^2*f[-alpha[5]]^2*f[-alpha[3]]^3*v[Lambda[1]</span>
+<span class="go"> + Lambda[4] - 1/3*Lambda[5]]^* + 2*f[-alpha[2]]*v[Lambda[1]</span>
+<span class="go"> + Lambda[4] - 1/3*Lambda[5]]^* + 3*f[-alpha[5]]*v[Lambda[1]</span>
+<span class="go"> + Lambda[4] - 1/3*Lambda[5]]^* + v[Lambda[1] + Lambda[4]</span>
+<span class="go"> - 1/3*Lambda[5]]^*</span>
<span class="gp">sage:</span> <span class="p">[</span><span class="n">M</span><span class="o">.</span><span class="n">degree_on_basis</span><span class="p">(</span><span class="n">m</span><span class="p">)</span> <span class="k">for</span> <span class="n">m</span> <span class="ow">in</span> <span class="n">elt</span><span class="o">.</span><span class="n">support</span><span class="p">()]</span>
-<span class="go">[Lambda[1] + 3*Lambda[2] - 2*Lambda[3] - 4/3*Lambda[5],</span>
+<span class="go">[3*Lambda[1] - Lambda[2] - 2*Lambda[3] + 4*Lambda[4] - 4/3*Lambda[5],</span>
<span class="go"> Lambda[1] + Lambda[4] - 1/3*Lambda[5],</span>
-<span class="go"> Lambda[1] + Lambda[3] + Lambda[4] - 7/3*Lambda[5],</span>
-<span class="go"> Lambda[1] + Lambda[3] - Lambda[4] - 1/3*Lambda[5]]</span>
+<span class="go"> 2*Lambda[1] - 2*Lambda[2] + Lambda[3] + Lambda[4] - 1/3*Lambda[5],</span>
+<span class="go"> Lambda[1] + Lambda[3] + Lambda[4] - 7/3*Lambda[5]]</span>
</pre></div>
</div>
</div>@@ -571,15 +572,16 @@ to <span class="math notranslate nohighlight">\(b\)</span> as <span class="math
<span class="gp">>>></span> <span class="n">M</span> <span class="o">=</span> <span class="n">g</span><span class="o">.</span><span class="n">verma_module</span><span class="p">(</span><span class="n">La</span><span class="p">[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">1</span><span class="p">)]</span> <span class="o">+</span> <span class="n">La</span><span class="p">[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">4</span><span class="p">)]</span> <span class="o">-</span> <span class="n">Integer</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span><span class="o">/</span><span class="n">Integer</span><span class="p">(</span><span class="mi">3</span><span class="p">)</span><span class="o">*</span><span class="n">La</span><span class="p">[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">5</span><span class="p">)])</span>
<span class="gp">>>></span> <span class="n">Mc</span> <span class="o">=</span> <span class="n">M</span><span class="o">.</span><span class="n">dual</span><span class="p">()</span>
<span class="gp">>>></span> <span class="n">elt</span> <span class="o">=</span> <span class="n">Mc</span><span class="o">.</span><span class="n">an_element</span><span class="p">();</span> <span class="n">elt</span>
-<span class="go">f[-alpha[5]]^2*f[-alpha[4]]^2*f[-alpha[3]]^3*v[Lambda[1] + Lambda[4] - 1/3*Lambda[5]]^*</span>
-<span class="go"> + 2*f[-alpha[5]]*v[Lambda[1] + Lambda[4] - 1/3*Lambda[5]]^*</span>
-<span class="go"> + 3*f[-alpha[4]]*v[Lambda[1] + Lambda[4] - 1/3*Lambda[5]]^*</span>
-<span class="go"> + v[Lambda[1] + Lambda[4] - 1/3*Lambda[5]]^*</span>
+<span class="go">f[-alpha[2]]^2*f[-alpha[5]]^2*f[-alpha[3]]^3*v[Lambda[1]</span>
+<span class="go"> + Lambda[4] - 1/3*Lambda[5]]^* + 2*f[-alpha[2]]*v[Lambda[1]</span>
+<span class="go"> + Lambda[4] - 1/3*Lambda[5]]^* + 3*f[-alpha[5]]*v[Lambda[1]</span>
+<span class="go"> + Lambda[4] - 1/3*Lambda[5]]^* + v[Lambda[1] + Lambda[4]</span>
+<span class="go"> - 1/3*Lambda[5]]^*</span>
<span class="gp">>>></span> <span class="p">[</span><span class="n">M</span><span class="o">.</span><span class="n">degree_on_basis</span><span class="p">(</span><span class="n">m</span><span class="p">)</span> <span class="k">for</span> <span class="n">m</span> <span class="ow">in</span> <span class="n">elt</span><span class="o">.</span><span class="n">support</span><span class="p">()]</span>
-<span class="go">[Lambda[1] + 3*Lambda[2] - 2*Lambda[3] - 4/3*Lambda[5],</span>
+<span class="go">[3*Lambda[1] - Lambda[2] - 2*Lambda[3] + 4*Lambda[4] - 4/3*Lambda[5],</span>
<span class="go"> Lambda[1] + Lambda[4] - 1/3*Lambda[5],</span>
-<span class="go"> Lambda[1] + Lambda[3] + Lambda[4] - 7/3*Lambda[5],</span>
-<span class="go"> Lambda[1] + Lambda[3] - Lambda[4] - 1/3*Lambda[5]]</span>
+<span class="go"> 2*Lambda[1] - 2*Lambda[2] + Lambda[3] + Lambda[4] - 1/3*Lambda[5],</span>
+<span class="go"> Lambda[1] + Lambda[3] + Lambda[4] - 7/3*Lambda[5]]</span>
</pre></div>
</div>
</div>html/en/reference/arithmetic_curves/sage/schemes/elliptic_curves/ell_field.html
diff --git a/html/en/reference/arithmetic_curves/sage/schemes/elliptic_curves/ell_field.html b/html/en/reference/arithmetic_curves/sage/schemes/elliptic_curves/ell_field.html
index 6472988..d6b334d 100644
--- a/html/en/reference/arithmetic_curves/sage/schemes/elliptic_curves/ell_field.html
+++ b/html/en/reference/arithmetic_curves/sage/schemes/elliptic_curves/ell_field.html@@ -2608,20 +2608,20 @@ class, append <code class="docutils literal notranslate"><span class="pre">*</sp
<span class="go"> '0*',</span>
<span class="go"> ...</span>
<span class="go"> '98*']</span>
-<span class="gp">sage:</span> <span class="n">G3</span><span class="o">.</span><span class="n">edges</span><span class="p">(</span><span class="n">sort</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
+<span class="gp">sage:</span> <span class="n">G3</span><span class="o">.</span><span class="n">edges</span><span class="p">(</span><span class="n">sort</span><span class="o">=</span><span class="kc">True</span><span class="p">,</span> <span class="n">sort_vertices</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
<span class="go">[('0', '0*', None),</span>
-<span class="go"> ('0', '13', None),</span>
+<span class="go"> ('106', '396', None),</span>
<span class="go"> ...</span>
-<span class="go"> ('48*', '98*', None)]</span>
+<span class="go"> ('98*', '48*', None)]</span>
<span class="go"> sage: G5 = E.isogeny_ell_graph(5, directed=False, label_by_j=True); G5</span>
<span class="go"> Graph on 9 vertices</span>
<span class="go"> sage: G5.vertices(sort=True)</span>
<span class="go"> ['13', '13*', '407', '407*', '52', '62', '62*', '98', '98*']</span>
-<span class="go"> sage: G5.edges(sort=True)</span>
-<span class="go"> [('13', '52', None),</span>
-<span class="go"> ('13', '98', None),</span>
+<span class="go"> sage: G5.edges(sort=True, sort_vertices=True)</span>
+<span class="go"> [('13', '98', None),</span>
+<span class="go"> ('13*', '98*', None),</span>
<span class="go"> ...</span>
-<span class="go"> ('62*', '98*', None)]</span>
+<span class="go"> ('98*', '62*', None)]</span>
</pre></div>
</div>
</div>@@ -2636,20 +2636,20 @@ class, append <code class="docutils literal notranslate"><span class="pre">*</sp
<span class="go"> '0*',</span>
<span class="go"> ...</span>
<span class="go"> '98*']</span>
-<span class="gp">>>></span> <span class="n">G3</span><span class="o">.</span><span class="n">edges</span><span class="p">(</span><span class="n">sort</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
+<span class="gp">>>></span> <span class="n">G3</span><span class="o">.</span><span class="n">edges</span><span class="p">(</span><span class="n">sort</span><span class="o">=</span><span class="kc">True</span><span class="p">,</span> <span class="n">sort_vertices</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
<span class="go">[('0', '0*', None),</span>
-<span class="go"> ('0', '13', None),</span>
+<span class="go"> ('106', '396', None),</span>
<span class="go"> ...</span>
-<span class="go"> ('48*', '98*', None)]</span>
+<span class="go"> ('98*', '48*', None)]</span>
<span class="gp">>>></span> <span class="n">G5</span> <span class="o">=</span> <span class="n">E</span><span class="o">.</span><span class="n">isogeny_ell_graph</span><span class="p">(</span><span class="n">Integer</span><span class="p">(</span><span class="mi">5</span><span class="p">),</span> <span class="n">directed</span><span class="o">=</span><span class="kc">False</span><span class="p">,</span> <span class="n">label_by_j</span><span class="o">=</span><span class="kc">True</span><span class="p">);</span> <span class="n">G5</span>
<span class="go"> Graph on 9 vertices</span>
<span class="gp">>>></span> <span class="n">G5</span><span class="o">.</span><span class="n">vertices</span><span class="p">(</span><span class="n">sort</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
<span class="go"> ['13', '13*', '407', '407*', '52', '62', '62*', '98', '98*']</span>
-<span class="gp">>>></span> <span class="n">G5</span><span class="o">.</span><span class="n">edges</span><span class="p">(</span><span class="n">sort</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
-<span class="go"> [('13', '52', None),</span>
-<span class="go"> ('13', '98', None),</span>
+<span class="gp">>>></span> <span class="n">G5</span><span class="o">.</span><span class="n">edges</span><span class="p">(</span><span class="n">sort</span><span class="o">=</span><span class="kc">True</span><span class="p">,</span> <span class="n">sort_vertices</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
+<span class="go"> [('13', '98', None),</span>
+<span class="go"> ('13*', '98*', None),</span>
<span class="go"> ...</span>
-<span class="go"> ('62*', '98*', None)]</span>
+<span class="go"> ('98*', '62*', None)]</span>
</pre></div>
</div>
</div>@@ -2681,11 +2681,11 @@ class, append <code class="docutils literal notranslate"><span class="pre">*</sp
<span class="go"> '102',</span>
<span class="go"> ...</span>
<span class="go"> '87*i + 190']</span>
-<span class="gp">sage:</span> <span class="n">H</span><span class="o">.</span><span class="n">edges</span><span class="p">(</span><span class="n">sort</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
+<span class="gp">sage:</span> <span class="n">H</span><span class="o">.</span><span class="n">edges</span><span class="p">(</span><span class="n">sort</span><span class="o">=</span><span class="kc">True</span><span class="p">,</span><span class="n">sort_vertices</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
<span class="go">[('0', '125', None),</span>
-<span class="go"> ('102', '125', None),</span>
+<span class="go"> ('102', '319', None),</span>
<span class="go"> ...</span>
-<span class="go"> ('81*i + 65', '87*i + 190', None)]</span>
+<span class="go"> ('87*i + 190', '81*i + 65', None)]</span>
</pre></div>
</div>
</div>@@ -2715,11 +2715,11 @@ class, append <code class="docutils literal notranslate"><span class="pre">*</sp
<span class="go"> '102',</span>
<span class="go"> ...</span>
<span class="go"> '87*i + 190']</span>
-<span class="gp">>>></span> <span class="n">H</span><span class="o">.</span><span class="n">edges</span><span class="p">(</span><span class="n">sort</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
+<span class="gp">>>></span> <span class="n">H</span><span class="o">.</span><span class="n">edges</span><span class="p">(</span><span class="n">sort</span><span class="o">=</span><span class="kc">True</span><span class="p">,</span><span class="n">sort_vertices</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
<span class="go">[('0', '125', None),</span>
-<span class="go"> ('102', '125', None),</span>
+<span class="go"> ('102', '319', None),</span>
<span class="go"> ...</span>
-<span class="go"> ('81*i + 65', '87*i + 190', None)]</span>
+<span class="go"> ('87*i + 190', '81*i + 65', None)]</span>
</pre></div>
</div>
</div>@@ -2736,23 +2736,23 @@ class, append <code class="docutils literal notranslate"><span class="pre">*</sp
<span class="go"> 'y^2 + x*y + y = x^3 + (-36)*x + (-70)',</span>
<span class="go"> 'y^2 + x*y + y = x^3 + (130*e-356)*x + (2000*e-2038)',</span>
<span class="go"> 'y^2 + x*y + y = x^3 + 4*x + (-6)']</span>
-<span class="gp">sage:</span> <span class="n">G2</span><span class="o">.</span><span class="n">edges</span><span class="p">(</span><span class="n">sort</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
-<span class="go">[('y^2 + x*y + y = x^3 + (-130*e-356)*x + (-2000*e-2038)',</span>
-<span class="go"> 'y^2 + x*y + y = x^3 + (-36)*x + (-70)', None),</span>
+<span class="gp">sage:</span> <span class="n">G2</span><span class="o">.</span><span class="n">edges</span><span class="p">(</span><span class="n">sort</span><span class="o">=</span><span class="kc">True</span><span class="p">,</span><span class="n">sort_vertices</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
+<span class="go">[('y^2 + x*y + y = x^3 + (-36)*x + (-70)',</span>
+<span class="go"> 'y^2 + x*y + y = x^3 + (-130*e-356)*x + (-2000*e-2038)', None),</span>
<span class="go"> ('y^2 + x*y + y = x^3 + (-36)*x + (-70)',</span>
<span class="go"> 'y^2 + x*y + y = x^3 + (130*e-356)*x + (2000*e-2038)', None),</span>
-<span class="go"> ('y^2 + x*y + y = x^3 + (-36)*x + (-70)',</span>
-<span class="go"> 'y^2 + x*y + y = x^3 + 4*x + (-6)', None)]</span>
+<span class="go"> ('y^2 + x*y + y = x^3 + 4*x + (-6)',</span>
+<span class="go"> 'y^2 + x*y + y = x^3 + (-36)*x + (-70)', None)]</span>
<span class="gp">sage:</span> <span class="n">G3</span> <span class="o">=</span> <span class="n">E</span><span class="o">.</span><span class="n">isogeny_ell_graph</span><span class="p">(</span><span class="mi">3</span><span class="p">,</span> <span class="n">directed</span><span class="o">=</span><span class="kc">False</span><span class="p">)</span>
<span class="gp">sage:</span> <span class="n">G3</span><span class="o">.</span><span class="n">vertices</span><span class="p">(</span><span class="n">sort</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
<span class="go">['y^2 + x*y + y = x^3 + (-1)*x',</span>
<span class="go"> 'y^2 + x*y + y = x^3 + (-171)*x + (-874)',</span>
<span class="go"> 'y^2 + x*y + y = x^3 + 4*x + (-6)']</span>
-<span class="gp">sage:</span> <span class="n">G3</span><span class="o">.</span><span class="n">edges</span><span class="p">(</span><span class="n">sort</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
-<span class="go">[('y^2 + x*y + y = x^3 + (-1)*x',</span>
-<span class="go"> 'y^2 + x*y + y = x^3 + 4*x + (-6)', None),</span>
-<span class="go"> ('y^2 + x*y + y = x^3 + (-171)*x + (-874)',</span>
-<span class="go"> 'y^2 + x*y + y = x^3 + 4*x + (-6)', None)]</span>
+<span class="gp">sage:</span> <span class="n">G3</span><span class="o">.</span><span class="n">edges</span><span class="p">(</span><span class="n">sort</span><span class="o">=</span><span class="kc">True</span><span class="p">,</span><span class="n">sort_vertices</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
+<span class="go">[('y^2 + x*y + y = x^3 + 4*x + (-6)',</span>
+<span class="go"> 'y^2 + x*y + y = x^3 + (-1)*x', None),</span>
+<span class="go"> ('y^2 + x*y + y = x^3 + 4*x + (-6)',</span>
+<span class="go"> 'y^2 + x*y + y = x^3 + (-171)*x + (-874)', None)]</span>
</pre></div>
</div>
</div>@@ -2767,23 +2767,23 @@ class, append <code class="docutils literal notranslate"><span class="pre">*</sp
<span class="go"> 'y^2 + x*y + y = x^3 + (-36)*x + (-70)',</span>
<span class="go"> 'y^2 + x*y + y = x^3 + (130*e-356)*x + (2000*e-2038)',</span>
<span class="go"> 'y^2 + x*y + y = x^3 + 4*x + (-6)']</span>
-<span class="gp">>>></span> <span class="n">G2</span><span class="o">.</span><span class="n">edges</span><span class="p">(</span><span class="n">sort</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
-<span class="go">[('y^2 + x*y + y = x^3 + (-130*e-356)*x + (-2000*e-2038)',</span>
-<span class="go"> 'y^2 + x*y + y = x^3 + (-36)*x + (-70)', None),</span>
+<span class="gp">>>></span> <span class="n">G2</span><span class="o">.</span><span class="n">edges</span><span class="p">(</span><span class="n">sort</span><span class="o">=</span><span class="kc">True</span><span class="p">,</span><span class="n">sort_vertices</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
+<span class="go">[('y^2 + x*y + y = x^3 + (-36)*x + (-70)',</span>
+<span class="go"> 'y^2 + x*y + y = x^3 + (-130*e-356)*x + (-2000*e-2038)', None),</span>
<span class="go"> ('y^2 + x*y + y = x^3 + (-36)*x + (-70)',</span>
<span class="go"> 'y^2 + x*y + y = x^3 + (130*e-356)*x + (2000*e-2038)', None),</span>
-<span class="go"> ('y^2 + x*y + y = x^3 + (-36)*x + (-70)',</span>
-<span class="go"> 'y^2 + x*y + y = x^3 + 4*x + (-6)', None)]</span>
+<span class="go"> ('y^2 + x*y + y = x^3 + 4*x + (-6)',</span>
+<span class="go"> 'y^2 + x*y + y = x^3 + (-36)*x + (-70)', None)]</span>
<span class="gp">>>></span> <span class="n">G3</span> <span class="o">=</span> <span class="n">E</span><span class="o">.</span><span class="n">isogeny_ell_graph</span><span class="p">(</span><span class="n">Integer</span><span class="p">(</span><span class="mi">3</span><span class="p">),</span> <span class="n">directed</span><span class="o">=</span><span class="kc">False</span><span class="p">)</span>
<span class="gp">>>></span> <span class="n">G3</span><span class="o">.</span><span class="n">vertices</span><span class="p">(</span><span class="n">sort</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
<span class="go">['y^2 + x*y + y = x^3 + (-1)*x',</span>
<span class="go"> 'y^2 + x*y + y = x^3 + (-171)*x + (-874)',</span>
<span class="go"> 'y^2 + x*y + y = x^3 + 4*x + (-6)']</span>
-<span class="gp">>>></span> <span class="n">G3</span><span class="o">.</span><span class="n">edges</span><span class="p">(</span><span class="n">sort</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
-<span class="go">[('y^2 + x*y + y = x^3 + (-1)*x',</span>
-<span class="go"> 'y^2 + x*y + y = x^3 + 4*x + (-6)', None),</span>
-<span class="go"> ('y^2 + x*y + y = x^3 + (-171)*x + (-874)',</span>
-<span class="go"> 'y^2 + x*y + y = x^3 + 4*x + (-6)', None)]</span>
+<span class="gp">>>></span> <span class="n">G3</span><span class="o">.</span><span class="n">edges</span><span class="p">(</span><span class="n">sort</span><span class="o">=</span><span class="kc">True</span><span class="p">,</span><span class="n">sort_vertices</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
+<span class="go">[('y^2 + x*y + y = x^3 + 4*x + (-6)',</span>
+<span class="go"> 'y^2 + x*y + y = x^3 + (-1)*x', None),</span>
+<span class="go"> ('y^2 + x*y + y = x^3 + 4*x + (-6)',</span>
+<span class="go"> 'y^2 + x*y + y = x^3 + (-171)*x + (-874)', None)]</span>
</pre></div>
</div>
</div>html/en/reference/categories/sage/categories/regular_crystals.html
diff --git a/html/en/reference/categories/sage/categories/regular_crystals.html b/html/en/reference/categories/sage/categories/regular_crystals.html
index 0aaf0e5..6ea4577 100644
--- a/html/en/reference/categories/sage/categories/regular_crystals.html
+++ b/html/en/reference/categories/sage/categories/regular_crystals.html@@ -673,13 +673,13 @@ encodes.</p>
<span class="go"> ([[1, 3], [2, 4]], [[1, 2], [3, 4]], 3)]</span>
<span class="gp">sage:</span> <span class="n">T</span> <span class="o">=</span> <span class="n">crystals</span><span class="o">.</span><span class="n">Tableaux</span><span class="p">([</span><span class="s1">'A'</span><span class="p">,</span><span class="mi">4</span><span class="p">],</span> <span class="n">shape</span><span class="o">=</span><span class="p">[</span><span class="mi">3</span><span class="p">,</span><span class="mi">2</span><span class="p">])</span>
<span class="gp">sage:</span> <span class="n">G</span> <span class="o">=</span> <span class="n">T</span><span class="p">(</span><span class="mi">2</span><span class="p">,</span><span class="mi">1</span><span class="p">,</span><span class="mi">4</span><span class="p">,</span><span class="mi">3</span><span class="p">,</span><span class="mi">5</span><span class="p">)</span><span class="o">.</span><span class="n">dual_equivalence_class</span><span class="p">()</span>
-<span class="gp">sage:</span> <span class="n">G</span><span class="o">.</span><span class="n">edges</span><span class="p">(</span><span class="n">sort</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
-<span class="go">[([[1, 3, 5], [2, 4]], [[1, 3, 4], [2, 5]], 4),</span>
-<span class="go"> ([[1, 3, 5], [2, 4]], [[1, 2, 5], [3, 4]], 2),</span>
-<span class="go"> ([[1, 3, 5], [2, 4]], [[1, 2, 5], [3, 4]], 3),</span>
+<span class="gp">sage:</span> <span class="n">G</span><span class="o">.</span><span class="n">edges</span><span class="p">(</span><span class="n">sort</span><span class="o">=</span><span class="kc">True</span><span class="p">,</span><span class="n">sort_vertices</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
+<span class="go">[([[1, 3, 4], [2, 5]], [[1, 3, 5], [2, 4]], 4),</span>
<span class="go"> ([[1, 3, 4], [2, 5]], [[1, 2, 4], [3, 5]], 2),</span>
-<span class="go"> ([[1, 2, 4], [3, 5]], [[1, 2, 3], [4, 5]], 3),</span>
-<span class="go"> ([[1, 2, 4], [3, 5]], [[1, 2, 3], [4, 5]], 4)]</span>
+<span class="go"> ([[1, 2, 5], [3, 4]], [[1, 3, 5], [2, 4]], 2),</span>
+<span class="go"> ([[1, 2, 5], [3, 4]], [[1, 3, 5], [2, 4]], 3),</span>
+<span class="go"> ([[1, 2, 3], [4, 5]], [[1, 2, 4], [3, 5]], 3),</span>
+<span class="go"> ([[1, 2, 3], [4, 5]], [[1, 2, 4], [3, 5]], 4)]</span>
</pre></div>
</div>
</div>@@ -692,13 +692,13 @@ encodes.</p>
<span class="go"> ([[1, 3], [2, 4]], [[1, 2], [3, 4]], 3)]</span>
<span class="gp">>>></span> <span class="n">T</span> <span class="o">=</span> <span class="n">crystals</span><span class="o">.</span><span class="n">Tableaux</span><span class="p">([</span><span class="s1">'A'</span><span class="p">,</span><span class="n">Integer</span><span class="p">(</span><span class="mi">4</span><span class="p">)],</span> <span class="n">shape</span><span class="o">=</span><span class="p">[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">3</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">2</span><span class="p">)])</span>
<span class="gp">>>></span> <span class="n">G</span> <span class="o">=</span> <span class="n">T</span><span class="p">(</span><span class="n">Integer</span><span class="p">(</span><span class="mi">2</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">1</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">4</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">3</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">5</span><span class="p">))</span><span class="o">.</span><span class="n">dual_equivalence_class</span><span class="p">()</span>
-<span class="gp">>>></span> <span class="n">G</span><span class="o">.</span><span class="n">edges</span><span class="p">(</span><span class="n">sort</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
-<span class="go">[([[1, 3, 5], [2, 4]], [[1, 3, 4], [2, 5]], 4),</span>
-<span class="go"> ([[1, 3, 5], [2, 4]], [[1, 2, 5], [3, 4]], 2),</span>
-<span class="go"> ([[1, 3, 5], [2, 4]], [[1, 2, 5], [3, 4]], 3),</span>
+<span class="gp">>>></span> <span class="n">G</span><span class="o">.</span><span class="n">edges</span><span class="p">(</span><span class="n">sort</span><span class="o">=</span><span class="kc">True</span><span class="p">,</span><span class="n">sort_vertices</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
+<span class="go">[([[1, 3, 4], [2, 5]], [[1, 3, 5], [2, 4]], 4),</span>
<span class="go"> ([[1, 3, 4], [2, 5]], [[1, 2, 4], [3, 5]], 2),</span>
-<span class="go"> ([[1, 2, 4], [3, 5]], [[1, 2, 3], [4, 5]], 3),</span>
-<span class="go"> ([[1, 2, 4], [3, 5]], [[1, 2, 3], [4, 5]], 4)]</span>
+<span class="go"> ([[1, 2, 5], [3, 4]], [[1, 3, 5], [2, 4]], 2),</span>
+<span class="go"> ([[1, 2, 5], [3, 4]], [[1, 3, 5], [2, 4]], 3),</span>
+<span class="go"> ([[1, 2, 3], [4, 5]], [[1, 2, 4], [3, 5]], 3),</span>
+<span class="go"> ([[1, 2, 3], [4, 5]], [[1, 2, 4], [3, 5]], 4)]</span>
</pre></div>
</div>
</div>html/en/reference/combinat/sage/combinat/growth.html
diff --git a/html/en/reference/combinat/sage/combinat/growth.html b/html/en/reference/combinat/sage/combinat/growth.html
index 591330d..9283727 100644
--- a/html/en/reference/combinat/sage/combinat/growth.html
+++ b/html/en/reference/combinat/sage/combinat/growth.html@@ -2232,8 +2232,8 @@ from this graph.</p>
<span class="gp">sage:</span> <span class="n">Q</span> <span class="o">=</span> <span class="n">Domino</span><span class="o">.</span><span class="n">Q_graph</span><span class="p">(</span><span class="mi">3</span><span class="p">);</span> <span class="n">Q</span>
<span class="go">Finite poset containing 8 elements</span>
-<span class="gp">sage:</span> <span class="n">Q</span><span class="o">.</span><span class="n">upper_covers</span><span class="p">(</span><span class="n">Partition</span><span class="p">([</span><span class="mi">1</span><span class="p">,</span><span class="mi">1</span><span class="p">]))</span>
-<span class="go">[[1, 1, 1, 1], [3, 1], [2, 2]]</span>
+<span class="gp">sage:</span> <span class="nb">sorted</span><span class="p">(</span><span class="n">Q</span><span class="o">.</span><span class="n">upper_covers</span><span class="p">(</span><span class="n">Partition</span><span class="p">([</span><span class="mi">1</span><span class="p">,</span><span class="mi">1</span><span class="p">])))</span>
+<span class="go">[[1, 1, 1, 1], [2, 2], [3, 1]]</span>
</pre></div>
</div>
</div>@@ -2243,8 +2243,8 @@ from this graph.</p>
<span class="gp">>>></span> <span class="n">Q</span> <span class="o">=</span> <span class="n">Domino</span><span class="o">.</span><span class="n">Q_graph</span><span class="p">(</span><span class="n">Integer</span><span class="p">(</span><span class="mi">3</span><span class="p">));</span> <span class="n">Q</span>
<span class="go">Finite poset containing 8 elements</span>
-<span class="gp">>>></span> <span class="n">Q</span><span class="o">.</span><span class="n">upper_covers</span><span class="p">(</span><span class="n">Partition</span><span class="p">([</span><span class="n">Integer</span><span class="p">(</span><span class="mi">1</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">1</span><span class="p">)]))</span>
-<span class="go">[[1, 1, 1, 1], [3, 1], [2, 2]]</span>
+<span class="gp">>>></span> <span class="nb">sorted</span><span class="p">(</span><span class="n">Q</span><span class="o">.</span><span class="n">upper_covers</span><span class="p">(</span><span class="n">Partition</span><span class="p">([</span><span class="n">Integer</span><span class="p">(</span><span class="mi">1</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">1</span><span class="p">)])))</span>
+<span class="go">[[1, 1, 1, 1], [2, 2], [3, 1]]</span>
</pre></div>
</div>
</div>html/en/reference/combinat/sage/combinat/permutation.html
diff --git a/html/en/reference/combinat/sage/combinat/permutation.html b/html/en/reference/combinat/sage/combinat/permutation.html
index 771485f..33a2595 100644
--- a/html/en/reference/combinat/sage/combinat/permutation.html
+++ b/html/en/reference/combinat/sage/combinat/permutation.html@@ -4964,12 +4964,12 @@ size of <span class="math notranslate nohighlight">\(p\)</span>) and order inher
<div class="tab-set docutils container">
<input checked="True" class="tab-input" id="tab-set--109-input--1" name="tab-set--109" type="radio"><label class="tab-label" for="tab-set--109-input--1">Sage</label><div class="tab-content docutils container">
<div class="highlight-ipycon notranslate"><div class="highlight"><pre><span></span><span class="gp">sage:</span> <span class="c1"># needs sage.combinat sage.graphs</span>
-<span class="gp">sage:</span> <span class="n">Permutation</span><span class="p">([</span><span class="mi">3</span><span class="p">,</span><span class="mi">1</span><span class="p">,</span><span class="mi">5</span><span class="p">,</span><span class="mi">4</span><span class="p">,</span><span class="mi">2</span><span class="p">])</span><span class="o">.</span><span class="n">permutation_poset</span><span class="p">()</span><span class="o">.</span><span class="n">cover_relations</span><span class="p">()</span>
-<span class="go">[[(2, 1), (5, 2)],</span>
+<span class="gp">sage:</span> <span class="nb">sorted</span><span class="p">(</span><span class="n">Permutation</span><span class="p">([</span><span class="mi">3</span><span class="p">,</span><span class="mi">1</span><span class="p">,</span><span class="mi">5</span><span class="p">,</span><span class="mi">4</span><span class="p">,</span><span class="mi">2</span><span class="p">])</span><span class="o">.</span><span class="n">permutation_poset</span><span class="p">()</span><span class="o">.</span><span class="n">cover_relations</span><span class="p">())</span>
+<span class="go">[[(1, 3), (3, 5)],</span>
+<span class="go"> [(1, 3), (4, 4)],</span>
<span class="go"> [(2, 1), (3, 5)],</span>
<span class="go"> [(2, 1), (4, 4)],</span>
-<span class="go"> [(1, 3), (3, 5)],</span>
-<span class="go"> [(1, 3), (4, 4)]]</span>
+<span class="go"> [(2, 1), (5, 2)]]</span>
<span class="gp">sage:</span> <span class="n">Permutation</span><span class="p">([])</span><span class="o">.</span><span class="n">permutation_poset</span><span class="p">()</span><span class="o">.</span><span class="n">cover_relations</span><span class="p">()</span>
<span class="go">[]</span>
<span class="gp">sage:</span> <span class="n">Permutation</span><span class="p">([</span><span class="mi">1</span><span class="p">,</span><span class="mi">3</span><span class="p">,</span><span class="mi">2</span><span class="p">])</span><span class="o">.</span><span class="n">permutation_poset</span><span class="p">()</span><span class="o">.</span><span class="n">cover_relations</span><span class="p">()</span>@@ -4983,12 +4983,12 @@ size of <span class="math notranslate nohighlight">\(p\)</span>) and order inher
<input class="tab-input" id="tab-set--109-input--2" name="tab-set--109" type="radio"><label class="tab-label" for="tab-set--109-input--2">Python</label><div class="tab-content docutils container">
<div class="highlight-ipycon notranslate"><div class="highlight"><pre><span></span><span class="gp">>>></span> <span class="kn">from</span> <span class="nn">sage.all</span> <span class="kn">import</span> <span class="o">*</span>
<span class="gp">>>></span> <span class="c1"># needs sage.combinat sage.graphs</span>
-<span class="gp">>>></span> <span class="n">Permutation</span><span class="p">([</span><span class="n">Integer</span><span class="p">(</span><span class="mi">3</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">1</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">5</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">4</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">2</span><span class="p">)])</span><span class="o">.</span><span class="n">permutation_poset</span><span class="p">()</span><span class="o">.</span><span class="n">cover_relations</span><span class="p">()</span>
-<span class="go">[[(2, 1), (5, 2)],</span>
+<span class="gp">>>></span> <span class="nb">sorted</span><span class="p">(</span><span class="n">Permutation</span><span class="p">([</span><span class="n">Integer</span><span class="p">(</span><span class="mi">3</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">1</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">5</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">4</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">2</span><span class="p">)])</span><span class="o">.</span><span class="n">permutation_poset</span><span class="p">()</span><span class="o">.</span><span class="n">cover_relations</span><span class="p">())</span>
+<span class="go">[[(1, 3), (3, 5)],</span>
+<span class="go"> [(1, 3), (4, 4)],</span>
<span class="go"> [(2, 1), (3, 5)],</span>
<span class="go"> [(2, 1), (4, 4)],</span>
-<span class="go"> [(1, 3), (3, 5)],</span>
-<span class="go"> [(1, 3), (4, 4)]]</span>
+<span class="go"> [(2, 1), (5, 2)]]</span>
<span class="gp">>>></span> <span class="n">Permutation</span><span class="p">([])</span><span class="o">.</span><span class="n">permutation_poset</span><span class="p">()</span><span class="o">.</span><span class="n">cover_relations</span><span class="p">()</span>
<span class="go">[]</span>
<span class="gp">>>></span> <span class="n">Permutation</span><span class="p">([</span><span class="n">Integer</span><span class="p">(</span><span class="mi">1</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">3</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">2</span><span class="p">)])</span><span class="o">.</span><span class="n">permutation_poset</span><span class="p">()</span><span class="o">.</span><span class="n">cover_relations</span><span class="p">()</span>html/en/reference/combinat/sage/combinat/posets/lattices.html
diff --git a/html/en/reference/combinat/sage/combinat/posets/lattices.html b/html/en/reference/combinat/sage/combinat/posets/lattices.html
index b1b2d6a..f2b7fa8 100644
--- a/html/en/reference/combinat/sage/combinat/posets/lattices.html
+++ b/html/en/reference/combinat/sage/combinat/posets/lattices.html@@ -5042,8 +5042,8 @@ when the lattice is subdirectly irreducible.)</p>
<div class="tab-set docutils container">
<input checked="True" class="tab-input" id="tab-set--88-input--1" name="tab-set--88" type="radio"><label class="tab-label" for="tab-set--88-input--1">Sage</label><div class="tab-content docutils container">
<div class="highlight-ipycon notranslate"><div class="highlight"><pre><span></span><span class="gp">sage:</span> <span class="n">L</span> <span class="o">=</span> <span class="n">LatticePoset</span><span class="p">(([],</span> <span class="p">[[</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">],[</span><span class="mi">1</span><span class="p">,</span><span class="mi">17</span><span class="p">],[</span><span class="mi">1</span><span class="p">,</span><span class="mi">8</span><span class="p">],[</span><span class="mi">2</span><span class="p">,</span><span class="mi">3</span><span class="p">],[</span><span class="mi">2</span><span class="p">,</span><span class="mi">22</span><span class="p">],[</span><span class="mi">2</span><span class="p">,</span><span class="mi">5</span><span class="p">],[</span><span class="mi">2</span><span class="p">,</span><span class="mi">7</span><span class="p">],[</span><span class="mi">17</span><span class="p">,</span><span class="mi">22</span><span class="p">],[</span><span class="mi">17</span><span class="p">,</span><span class="mi">13</span><span class="p">],[</span><span class="mi">8</span><span class="p">,</span><span class="mi">7</span><span class="p">],[</span><span class="mi">8</span><span class="p">,</span><span class="mi">13</span><span class="p">],[</span><span class="mi">3</span><span class="p">,</span><span class="mi">16</span><span class="p">],[</span><span class="mi">3</span><span class="p">,</span><span class="mi">9</span><span class="p">],[</span><span class="mi">22</span><span class="p">,</span><span class="mi">16</span><span class="p">],[</span><span class="mi">22</span><span class="p">,</span><span class="mi">18</span><span class="p">],[</span><span class="mi">22</span><span class="p">,</span><span class="mi">10</span><span class="p">],[</span><span class="mi">5</span><span class="p">,</span><span class="mi">18</span><span class="p">],[</span><span class="mi">5</span><span class="p">,</span><span class="mi">14</span><span class="p">],[</span><span class="mi">7</span><span class="p">,</span><span class="mi">9</span><span class="p">],[</span><span class="mi">7</span><span class="p">,</span><span class="mi">14</span><span class="p">],[</span><span class="mi">7</span><span class="p">,</span><span class="mi">10</span><span class="p">],[</span><span class="mi">13</span><span class="p">,</span><span class="mi">10</span><span class="p">],[</span><span class="mi">16</span><span class="p">,</span><span class="mi">6</span><span class="p">],[</span><span class="mi">16</span><span class="p">,</span><span class="mi">19</span><span class="p">],[</span><span class="mi">9</span><span class="p">,</span><span class="mi">19</span><span class="p">],[</span><span class="mi">18</span><span class="p">,</span><span class="mi">6</span><span class="p">],[</span><span class="mi">18</span><span class="p">,</span><span class="mi">33</span><span class="p">],[</span><span class="mi">14</span><span class="p">,</span><span class="mi">33</span><span class="p">],[</span><span class="mi">10</span><span class="p">,</span><span class="mi">19</span><span class="p">],[</span><span class="mi">10</span><span class="p">,</span><span class="mi">33</span><span class="p">],[</span><span class="mi">6</span><span class="p">,</span><span class="mi">4</span><span class="p">],[</span><span class="mi">19</span><span class="p">,</span><span class="mi">4</span><span class="p">],[</span><span class="mi">33</span><span class="p">,</span><span class="mi">4</span><span class="p">]]))</span>
-<span class="gp">sage:</span> <span class="n">L</span><span class="o">.</span><span class="n">sublattice</span><span class="p">([</span><span class="mi">14</span><span class="p">,</span> <span class="mi">13</span><span class="p">,</span> <span class="mi">22</span><span class="p">])</span><span class="o">.</span><span class="n">list</span><span class="p">()</span>
-<span class="go">[1, 2, 8, 7, 14, 17, 13, 22, 10, 33]</span>
+<span class="gp">sage:</span> <span class="nb">sorted</span><span class="p">(</span><span class="n">L</span><span class="o">.</span><span class="n">sublattice</span><span class="p">([</span><span class="mi">14</span><span class="p">,</span> <span class="mi">13</span><span class="p">,</span> <span class="mi">22</span><span class="p">])</span><span class="o">.</span><span class="n">list</span><span class="p">())</span>
+<span class="go">[1, 2, 7, 8, 10, 13, 14, 17, 22, 33]</span>
<span class="gp">sage:</span> <span class="n">L</span> <span class="o">=</span> <span class="n">posets</span><span class="o">.</span><span class="n">BooleanLattice</span><span class="p">(</span><span class="mi">3</span><span class="p">)</span>
<span class="gp">sage:</span> <span class="n">L</span><span class="o">.</span><span class="n">sublattice</span><span class="p">([</span><span class="mi">3</span><span class="p">,</span><span class="mi">5</span><span class="p">,</span><span class="mi">6</span><span class="p">,</span><span class="mi">7</span><span class="p">])</span>@@ -5054,8 +5054,8 @@ when the lattice is subdirectly irreducible.)</p>
<input class="tab-input" id="tab-set--88-input--2" name="tab-set--88" type="radio"><label class="tab-label" for="tab-set--88-input--2">Python</label><div class="tab-content docutils container">
<div class="highlight-ipycon notranslate"><div class="highlight"><pre><span></span><span class="gp">>>></span> <span class="kn">from</span> <span class="nn">sage.all</span> <span class="kn">import</span> <span class="o">*</span>
<span class="gp">>>></span> <span class="n">L</span> <span class="o">=</span> <span class="n">LatticePoset</span><span class="p">(([],</span> <span class="p">[[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">1</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">2</span><span class="p">)],[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">1</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">17</span><span class="p">)],[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">1</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">8</span><span class="p">)],[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">2</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">3</span><span class="p">)],[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">2</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">22</span><span class="p">)],[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">2</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">5</span><span class="p">)],[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">2</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">7</span><span class="p">)],[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">17</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">22</span><span class="p">)],[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">17</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">13</span><span class="p">)],[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">8</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">7</span><span class="p">)],[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">8</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">13</span><span class="p">)],[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">3</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">16</span><span class="p">)],[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">3</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">9</span><span class="p">)],[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">22</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">16</span><span class="p">)],[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">22</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">18</span><span class="p">)],[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">22</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">10</span><span class="p">)],[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">5</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">18</span><span class="p">)],[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">5</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">14</span><span class="p">)],[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">7</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">9</span><span class="p">)],[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">7</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">14</span><span class="p">)],[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">7</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">10</span><span class="p">)],[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">13</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">10</span><span class="p">)],[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">16</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">6</span><span class="p">)],[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">16</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">19</span><span class="p">)],[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">9</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">19</span><span class="p">)],[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">18</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">6</span><span class="p">)],[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">18</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">33</span><span class="p">)],[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">14</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">33</span><span class="p">)],[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">10</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">19</span><span class="p">)],[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">10</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">33</span><span class="p">)],[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">6</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">4</span><span class="p">)],[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">19</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">4</span><span class="p">)],[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">33</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">4</span><span class="p">)]]))</span>
-<span class="gp">>>></span> <span class="n">L</span><span class="o">.</span><span class="n">sublattice</span><span class="p">([</span><span class="n">Integer</span><span class="p">(</span><span class="mi">14</span><span class="p">),</span> <span class="n">Integer</span><span class="p">(</span><span class="mi">13</span><span class="p">),</span> <span class="n">Integer</span><span class="p">(</span><span class="mi">22</span><span class="p">)])</span><span class="o">.</span><span class="n">list</span><span class="p">()</span>
-<span class="go">[1, 2, 8, 7, 14, 17, 13, 22, 10, 33]</span>
+<span class="gp">>>></span> <span class="nb">sorted</span><span class="p">(</span><span class="n">L</span><span class="o">.</span><span class="n">sublattice</span><span class="p">([</span><span class="n">Integer</span><span class="p">(</span><span class="mi">14</span><span class="p">),</span> <span class="n">Integer</span><span class="p">(</span><span class="mi">13</span><span class="p">),</span> <span class="n">Integer</span><span class="p">(</span><span class="mi">22</span><span class="p">)])</span><span class="o">.</span><span class="n">list</span><span class="p">())</span>
+<span class="go">[1, 2, 7, 8, 10, 13, 14, 17, 22, 33]</span>
<span class="gp">>>></span> <span class="n">L</span> <span class="o">=</span> <span class="n">posets</span><span class="o">.</span><span class="n">BooleanLattice</span><span class="p">(</span><span class="n">Integer</span><span class="p">(</span><span class="mi">3</span><span class="p">))</span>
<span class="gp">>>></span> <span class="n">L</span><span class="o">.</span><span class="n">sublattice</span><span class="p">([</span><span class="n">Integer</span><span class="p">(</span><span class="mi">3</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">5</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">6</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">7</span><span class="p">)])</span>@@ -5589,8 +5589,8 @@ versa:</p>
<div class="highlight-ipycon notranslate"><div class="highlight"><pre><span></span><span class="gp">sage:</span> <span class="n">L</span> <span class="o">=</span> <span class="n">posets</span><span class="o">.</span><span class="n">DivisorLattice</span><span class="p">(</span><span class="mi">1000</span><span class="p">)</span>
<span class="gp">sage:</span> <span class="n">L_</span> <span class="o">=</span> <span class="n">L</span><span class="o">.</span><span class="n">submeetsemilattice</span><span class="p">([</span><span class="mi">200</span><span class="p">,</span> <span class="mi">250</span><span class="p">,</span> <span class="mi">125</span><span class="p">]);</span> <span class="n">L_</span>
<span class="go">Finite meet-semilattice containing 5 elements</span>
-<span class="gp">sage:</span> <span class="n">L_</span><span class="o">.</span><span class="n">list</span><span class="p">()</span>
-<span class="go">[25, 50, 200, 125, 250]</span>
+<span class="gp">sage:</span> <span class="nb">sorted</span><span class="p">(</span><span class="n">L_</span><span class="o">.</span><span class="n">list</span><span class="p">())</span>
+<span class="go">[25, 50, 125, 200, 250]</span>
</pre></div>
</div>
</div>@@ -5599,8 +5599,8 @@ versa:</p>
<span class="gp">>>></span> <span class="n">L</span> <span class="o">=</span> <span class="n">posets</span><span class="o">.</span><span class="n">DivisorLattice</span><span class="p">(</span><span class="n">Integer</span><span class="p">(</span><span class="mi">1000</span><span class="p">))</span>
<span class="gp">>>></span> <span class="n">L_</span> <span class="o">=</span> <span class="n">L</span><span class="o">.</span><span class="n">submeetsemilattice</span><span class="p">([</span><span class="n">Integer</span><span class="p">(</span><span class="mi">200</span><span class="p">),</span> <span class="n">Integer</span><span class="p">(</span><span class="mi">250</span><span class="p">),</span> <span class="n">Integer</span><span class="p">(</span><span class="mi">125</span><span class="p">)]);</span> <span class="n">L_</span>
<span class="go">Finite meet-semilattice containing 5 elements</span>
-<span class="gp">>>></span> <span class="n">L_</span><span class="o">.</span><span class="n">list</span><span class="p">()</span>
-<span class="go">[25, 50, 200, 125, 250]</span>
+<span class="gp">>>></span> <span class="nb">sorted</span><span class="p">(</span><span class="n">L_</span><span class="o">.</span><span class="n">list</span><span class="p">())</span>
+<span class="go">[25, 50, 125, 200, 250]</span>
</pre></div>
</div>
</div>html/en/reference/combinat/sage/combinat/posets/poset_examples.html
diff --git a/html/en/reference/combinat/sage/combinat/posets/poset_examples.html b/html/en/reference/combinat/sage/combinat/posets/poset_examples.html
index 16e9e18..efa8b81 100644
--- a/html/en/reference/combinat/sage/combinat/posets/poset_examples.html
+++ b/html/en/reference/combinat/sage/combinat/posets/poset_examples.html@@ -2440,7 +2440,7 @@ of size less than or equal to <span class="math notranslate nohighlight">\(n\)</
<input checked="True" class="tab-input" id="tab-set--44-input--1" name="tab-set--44" type="radio"><label class="tab-label" for="tab-set--44-input--1">Sage</label><div class="tab-content docutils container">
<div class="highlight-ipycon notranslate"><div class="highlight"><pre><span></span><span class="gp">sage:</span> <span class="n">P</span> <span class="o">=</span> <span class="n">posets</span><span class="o">.</span><span class="n">YoungsLattice</span><span class="p">(</span><span class="mi">3</span><span class="p">);</span> <span class="n">P</span>
<span class="go">Finite meet-semilattice containing 7 elements</span>
-<span class="gp">sage:</span> <span class="n">P</span><span class="o">.</span><span class="n">cover_relations</span><span class="p">()</span>
+<span class="gp">sage:</span> <span class="nb">sorted</span><span class="p">(</span><span class="n">P</span><span class="o">.</span><span class="n">cover_relations</span><span class="p">())</span>
<span class="go">[[[], [1]],</span>
<span class="go"> [[1], [1, 1]],</span>
<span class="go"> [[1], [2]],</span>@@ -2455,7 +2455,7 @@ of size less than or equal to <span class="math notranslate nohighlight">\(n\)</
<div class="highlight-ipycon notranslate"><div class="highlight"><pre><span></span><span class="gp">>>></span> <span class="kn">from</span> <span class="nn">sage.all</span> <span class="kn">import</span> <span class="o">*</span>
<span class="gp">>>></span> <span class="n">P</span> <span class="o">=</span> <span class="n">posets</span><span class="o">.</span><span class="n">YoungsLattice</span><span class="p">(</span><span class="n">Integer</span><span class="p">(</span><span class="mi">3</span><span class="p">));</span> <span class="n">P</span>
<span class="go">Finite meet-semilattice containing 7 elements</span>
-<span class="gp">>>></span> <span class="n">P</span><span class="o">.</span><span class="n">cover_relations</span><span class="p">()</span>
+<span class="gp">>>></span> <span class="nb">sorted</span><span class="p">(</span><span class="n">P</span><span class="o">.</span><span class="n">cover_relations</span><span class="p">())</span>
<span class="go">[[[], [1]],</span>
<span class="go"> [[1], [1, 1]],</span>
<span class="go"> [[1], [2]],</span>@@ -2484,7 +2484,7 @@ partition <span class="math notranslate nohighlight">\(lam\)</span> in Young’s
<div class="highlight-ipycon notranslate"><div class="highlight"><pre><span></span><span class="gp">sage:</span> <span class="n">P</span> <span class="o">=</span> <span class="n">posets</span><span class="o">.</span><span class="n">YoungsLatticePrincipalOrderIdeal</span><span class="p">(</span><span class="n">Partition</span><span class="p">([</span><span class="mi">2</span><span class="p">,</span><span class="mi">2</span><span class="p">]))</span>
<span class="gp">sage:</span> <span class="n">P</span>
<span class="go">Finite lattice containing 6 elements</span>
-<span class="gp">sage:</span> <span class="n">P</span><span class="o">.</span><span class="n">cover_relations</span><span class="p">()</span>
+<span class="gp">sage:</span> <span class="nb">sorted</span><span class="p">(</span><span class="n">P</span><span class="o">.</span><span class="n">cover_relations</span><span class="p">())</span>
<span class="go">[[[], [1]],</span>
<span class="go"> [[1], [1, 1]],</span>
<span class="go"> [[1], [2]],</span>@@ -2499,7 +2499,7 @@ partition <span class="math notranslate nohighlight">\(lam\)</span> in Young’s
<span class="gp">>>></span> <span class="n">P</span> <span class="o">=</span> <span class="n">posets</span><span class="o">.</span><span class="n">YoungsLatticePrincipalOrderIdeal</span><span class="p">(</span><span class="n">Partition</span><span class="p">([</span><span class="n">Integer</span><span class="p">(</span><span class="mi">2</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">2</span><span class="p">)]))</span>
<span class="gp">>>></span> <span class="n">P</span>
<span class="go">Finite lattice containing 6 elements</span>
-<span class="gp">>>></span> <span class="n">P</span><span class="o">.</span><span class="n">cover_relations</span><span class="p">()</span>
+<span class="gp">>>></span> <span class="nb">sorted</span><span class="p">(</span><span class="n">P</span><span class="o">.</span><span class="n">cover_relations</span><span class="p">())</span>
<span class="go">[[[], [1]],</span>
<span class="go"> [[1], [1, 1]],</span>
<span class="go"> [[1], [2]],</span>html/en/reference/combinat/sage/combinat/posets/posets.html
diff --git a/html/en/reference/combinat/sage/combinat/posets/posets.html b/html/en/reference/combinat/sage/combinat/posets/posets.html
index dde149f..cc85f98 100644
--- a/html/en/reference/combinat/sage/combinat/posets/posets.html
+++ b/html/en/reference/combinat/sage/combinat/posets/posets.html@@ -2100,7 +2100,7 @@ function of <span class="math notranslate nohighlight">\(P\)</span>.</p>
<div class="tab-set docutils container">
<input checked="True" class="tab-input" id="tab-set--24-input--1" name="tab-set--24" type="radio"><label class="tab-label" for="tab-set--24-input--1">Sage</label><div class="tab-content docutils container">
<div class="highlight-ipycon notranslate"><div class="highlight"><pre><span></span><span class="gp">sage:</span> <span class="n">P</span> <span class="o">=</span> <span class="n">Poset</span><span class="p">((</span><span class="n">divisors</span><span class="p">(</span><span class="mi">1000</span><span class="p">),</span> <span class="n">attrcall</span><span class="p">(</span><span class="s2">"divides"</span><span class="p">)))</span>
-<span class="gp">sage:</span> <span class="n">P</span><span class="o">.</span><span class="n">closed_interval</span><span class="p">(</span><span class="mi">2</span><span class="p">,</span> <span class="mi">100</span><span class="p">)</span>
+<span class="gp">sage:</span> <span class="nb">sorted</span><span class="p">(</span><span class="n">P</span><span class="o">.</span><span class="n">closed_interval</span><span class="p">(</span><span class="mi">2</span><span class="p">,</span> <span class="mi">100</span><span class="p">))</span>
<span class="go">[2, 4, 10, 20, 50, 100]</span>
</pre></div>
</div>@@ -2108,7 +2108,7 @@ function of <span class="math notranslate nohighlight">\(P\)</span>.</p>
<input class="tab-input" id="tab-set--24-input--2" name="tab-set--24" type="radio"><label class="tab-label" for="tab-set--24-input--2">Python</label><div class="tab-content docutils container">
<div class="highlight-ipycon notranslate"><div class="highlight"><pre><span></span><span class="gp">>>></span> <span class="kn">from</span> <span class="nn">sage.all</span> <span class="kn">import</span> <span class="o">*</span>
<span class="gp">>>></span> <span class="n">P</span> <span class="o">=</span> <span class="n">Poset</span><span class="p">((</span><span class="n">divisors</span><span class="p">(</span><span class="n">Integer</span><span class="p">(</span><span class="mi">1000</span><span class="p">)),</span> <span class="n">attrcall</span><span class="p">(</span><span class="s2">"divides"</span><span class="p">)))</span>
-<span class="gp">>>></span> <span class="n">P</span><span class="o">.</span><span class="n">closed_interval</span><span class="p">(</span><span class="n">Integer</span><span class="p">(</span><span class="mi">2</span><span class="p">),</span> <span class="n">Integer</span><span class="p">(</span><span class="mi">100</span><span class="p">))</span>
+<span class="gp">>>></span> <span class="nb">sorted</span><span class="p">(</span><span class="n">P</span><span class="o">.</span><span class="n">closed_interval</span><span class="p">(</span><span class="n">Integer</span><span class="p">(</span><span class="mi">2</span><span class="p">),</span> <span class="n">Integer</span><span class="p">(</span><span class="mi">100</span><span class="p">)))</span>
<span class="go">[2, 4, 10, 20, 50, 100]</span>
</pre></div>
</div>@@ -3670,8 +3670,8 @@ about graphviz.</p>
<div class="highlight-ipycon notranslate"><div class="highlight"><pre><span></span><span class="gp">sage:</span> <span class="n">P</span> <span class="o">=</span> <span class="n">Poset</span><span class="p">({</span><span class="s1">'a'</span><span class="p">:[</span><span class="s1">'b'</span><span class="p">],</span><span class="s1">'b'</span><span class="p">:[</span><span class="s1">'d'</span><span class="p">],</span><span class="s1">'c'</span><span class="p">:[</span><span class="s1">'d'</span><span class="p">],</span><span class="s1">'d'</span><span class="p">:[</span><span class="s1">'f'</span><span class="p">],</span><span class="s1">'e'</span><span class="p">:[</span><span class="s1">'f'</span><span class="p">],</span><span class="s1">'f'</span><span class="p">:[]})</span>
<span class="gp">sage:</span> <span class="nb">print</span><span class="p">(</span><span class="n">P</span><span class="o">.</span><span class="n">graphviz_string</span><span class="p">())</span>
<span class="go">graph {</span>
-<span class="go">"f";"d";"b";"a";"c";"e";</span>
-<span class="go">"f"--"e";"d"--"c";"b"--"a";"d"--"b";"f"--"d";</span>
+<span class="go">"f";"e";"d";"c";"b";"a";</span>
+<span class="go">"b"--"a";"d"--"b";"d"--"c";"f"--"d";"f"--"e";</span>
<span class="go">}</span>
</pre></div>
</div>@@ -3681,8 +3681,8 @@ about graphviz.</p>
<span class="gp">>>></span> <span class="n">P</span> <span class="o">=</span> <span class="n">Poset</span><span class="p">({</span><span class="s1">'a'</span><span class="p">:[</span><span class="s1">'b'</span><span class="p">],</span><span class="s1">'b'</span><span class="p">:[</span><span class="s1">'d'</span><span class="p">],</span><span class="s1">'c'</span><span class="p">:[</span><span class="s1">'d'</span><span class="p">],</span><span class="s1">'d'</span><span class="p">:[</span><span class="s1">'f'</span><span class="p">],</span><span class="s1">'e'</span><span class="p">:[</span><span class="s1">'f'</span><span class="p">],</span><span class="s1">'f'</span><span class="p">:[]})</span>
<span class="gp">>>></span> <span class="nb">print</span><span class="p">(</span><span class="n">P</span><span class="o">.</span><span class="n">graphviz_string</span><span class="p">())</span>
<span class="go">graph {</span>
-<span class="go">"f";"d";"b";"a";"c";"e";</span>
-<span class="go">"f"--"e";"d"--"c";"b"--"a";"d"--"b";"f"--"d";</span>
+<span class="go">"f";"e";"d";"c";"b";"a";</span>
+<span class="go">"b"--"a";"d"--"b";"d"--"c";"f"--"d";"f"--"e";</span>
<span class="go">}</span>
</pre></div>
</div>@@ -7232,7 +7232,7 @@ function evaluated at <code class="docutils literal notranslate"><span class="pr
<div class="tab-set docutils container">
<input checked="True" class="tab-input" id="tab-set--148-input--1" name="tab-set--148" type="radio"><label class="tab-label" for="tab-set--148-input--1">Sage</label><div class="tab-content docutils container">
<div class="highlight-ipycon notranslate"><div class="highlight"><pre><span></span><span class="gp">sage:</span> <span class="n">P</span> <span class="o">=</span> <span class="n">Poset</span><span class="p">((</span><span class="n">divisors</span><span class="p">(</span><span class="mi">1000</span><span class="p">),</span> <span class="n">attrcall</span><span class="p">(</span><span class="s2">"divides"</span><span class="p">)))</span>
-<span class="gp">sage:</span> <span class="n">P</span><span class="o">.</span><span class="n">open_interval</span><span class="p">(</span><span class="mi">2</span><span class="p">,</span> <span class="mi">100</span><span class="p">)</span>
+<span class="gp">sage:</span> <span class="nb">sorted</span><span class="p">(</span><span class="n">P</span><span class="o">.</span><span class="n">open_interval</span><span class="p">(</span><span class="mi">2</span><span class="p">,</span> <span class="mi">100</span><span class="p">))</span>
<span class="go">[4, 10, 20, 50]</span>
</pre></div>
</div>@@ -7240,7 +7240,7 @@ function evaluated at <code class="docutils literal notranslate"><span class="pr
<input class="tab-input" id="tab-set--148-input--2" name="tab-set--148" type="radio"><label class="tab-label" for="tab-set--148-input--2">Python</label><div class="tab-content docutils container">
<div class="highlight-ipycon notranslate"><div class="highlight"><pre><span></span><span class="gp">>>></span> <span class="kn">from</span> <span class="nn">sage.all</span> <span class="kn">import</span> <span class="o">*</span>
<span class="gp">>>></span> <span class="n">P</span> <span class="o">=</span> <span class="n">Poset</span><span class="p">((</span><span class="n">divisors</span><span class="p">(</span><span class="n">Integer</span><span class="p">(</span><span class="mi">1000</span><span class="p">)),</span> <span class="n">attrcall</span><span class="p">(</span><span class="s2">"divides"</span><span class="p">)))</span>
-<span class="gp">>>></span> <span class="n">P</span><span class="o">.</span><span class="n">open_interval</span><span class="p">(</span><span class="n">Integer</span><span class="p">(</span><span class="mi">2</span><span class="p">),</span> <span class="n">Integer</span><span class="p">(</span><span class="mi">100</span><span class="p">))</span>
+<span class="gp">>>></span> <span class="nb">sorted</span><span class="p">(</span><span class="n">P</span><span class="o">.</span><span class="n">open_interval</span><span class="p">(</span><span class="n">Integer</span><span class="p">(</span><span class="mi">2</span><span class="p">),</span> <span class="n">Integer</span><span class="p">(</span><span class="mi">100</span><span class="p">)))</span>
<span class="go">[4, 10, 20, 50]</span>
</pre></div>
</div>@@ -7338,16 +7338,16 @@ upset.</p>
<div class="tab-set docutils container">
<input checked="True" class="tab-input" id="tab-set--151-input--1" name="tab-set--151" type="radio"><label class="tab-label" for="tab-set--151-input--1">Sage</label><div class="tab-content docutils container">
<div class="highlight-ipycon notranslate"><div class="highlight"><pre><span></span><span class="gp">sage:</span> <span class="n">P</span> <span class="o">=</span> <span class="n">Poset</span><span class="p">((</span><span class="n">divisors</span><span class="p">(</span><span class="mi">1000</span><span class="p">),</span> <span class="n">attrcall</span><span class="p">(</span><span class="s2">"divides"</span><span class="p">)))</span>
-<span class="gp">sage:</span> <span class="n">P</span><span class="o">.</span><span class="n">order_filter</span><span class="p">([</span><span class="mi">20</span><span class="p">,</span> <span class="mi">25</span><span class="p">])</span>
-<span class="go">[20, 40, 25, 50, 100, 200, 125, 250, 500, 1000]</span>
+<span class="gp">sage:</span> <span class="nb">sorted</span><span class="p">(</span><span class="n">P</span><span class="o">.</span><span class="n">order_filter</span><span class="p">([</span><span class="mi">20</span><span class="p">,</span> <span class="mi">25</span><span class="p">]))</span>
+<span class="go">[20, 25, 40, 50, 100, 125, 200, 250, 500, 1000]</span>
</pre></div>
</div>
</div>
<input class="tab-input" id="tab-set--151-input--2" name="tab-set--151" type="radio"><label class="tab-label" for="tab-set--151-input--2">Python</label><div class="tab-content docutils container">
<div class="highlight-ipycon notranslate"><div class="highlight"><pre><span></span><span class="gp">>>></span> <span class="kn">from</span> <span class="nn">sage.all</span> <span class="kn">import</span> <span class="o">*</span>
<span class="gp">>>></span> <span class="n">P</span> <span class="o">=</span> <span class="n">Poset</span><span class="p">((</span><span class="n">divisors</span><span class="p">(</span><span class="n">Integer</span><span class="p">(</span><span class="mi">1000</span><span class="p">)),</span> <span class="n">attrcall</span><span class="p">(</span><span class="s2">"divides"</span><span class="p">)))</span>
-<span class="gp">>>></span> <span class="n">P</span><span class="o">.</span><span class="n">order_filter</span><span class="p">([</span><span class="n">Integer</span><span class="p">(</span><span class="mi">20</span><span class="p">),</span> <span class="n">Integer</span><span class="p">(</span><span class="mi">25</span><span class="p">)])</span>
-<span class="go">[20, 40, 25, 50, 100, 200, 125, 250, 500, 1000]</span>
+<span class="gp">>>></span> <span class="nb">sorted</span><span class="p">(</span><span class="n">P</span><span class="o">.</span><span class="n">order_filter</span><span class="p">([</span><span class="n">Integer</span><span class="p">(</span><span class="mi">20</span><span class="p">),</span> <span class="n">Integer</span><span class="p">(</span><span class="mi">25</span><span class="p">)]))</span>
+<span class="go">[20, 25, 40, 50, 100, 125, 200, 250, 500, 1000]</span>
</pre></div>
</div>
</div>@@ -7370,7 +7370,7 @@ downset.</p>
<div class="tab-set docutils container">
<input checked="True" class="tab-input" id="tab-set--152-input--1" name="tab-set--152" type="radio"><label class="tab-label" for="tab-set--152-input--1">Sage</label><div class="tab-content docutils container">
<div class="highlight-ipycon notranslate"><div class="highlight"><pre><span></span><span class="gp">sage:</span> <span class="n">P</span> <span class="o">=</span> <span class="n">Poset</span><span class="p">((</span><span class="n">divisors</span><span class="p">(</span><span class="mi">1000</span><span class="p">),</span> <span class="n">attrcall</span><span class="p">(</span><span class="s2">"divides"</span><span class="p">)))</span>
-<span class="gp">sage:</span> <span class="n">P</span><span class="o">.</span><span class="n">order_ideal</span><span class="p">([</span><span class="mi">20</span><span class="p">,</span> <span class="mi">25</span><span class="p">])</span>
+<span class="gp">sage:</span> <span class="nb">sorted</span><span class="p">(</span><span class="n">P</span><span class="o">.</span><span class="n">order_ideal</span><span class="p">([</span><span class="mi">20</span><span class="p">,</span> <span class="mi">25</span><span class="p">]))</span>
<span class="go">[1, 2, 4, 5, 10, 20, 25]</span>
</pre></div>
</div>@@ -7378,7 +7378,7 @@ downset.</p>
<input class="tab-input" id="tab-set--152-input--2" name="tab-set--152" type="radio"><label class="tab-label" for="tab-set--152-input--2">Python</label><div class="tab-content docutils container">
<div class="highlight-ipycon notranslate"><div class="highlight"><pre><span></span><span class="gp">>>></span> <span class="kn">from</span> <span class="nn">sage.all</span> <span class="kn">import</span> <span class="o">*</span>
<span class="gp">>>></span> <span class="n">P</span> <span class="o">=</span> <span class="n">Poset</span><span class="p">((</span><span class="n">divisors</span><span class="p">(</span><span class="n">Integer</span><span class="p">(</span><span class="mi">1000</span><span class="p">)),</span> <span class="n">attrcall</span><span class="p">(</span><span class="s2">"divides"</span><span class="p">)))</span>
-<span class="gp">>>></span> <span class="n">P</span><span class="o">.</span><span class="n">order_ideal</span><span class="p">([</span><span class="n">Integer</span><span class="p">(</span><span class="mi">20</span><span class="p">),</span> <span class="n">Integer</span><span class="p">(</span><span class="mi">25</span><span class="p">)])</span>
+<span class="gp">>>></span> <span class="nb">sorted</span><span class="p">(</span><span class="n">P</span><span class="o">.</span><span class="n">order_ideal</span><span class="p">([</span><span class="n">Integer</span><span class="p">(</span><span class="mi">20</span><span class="p">),</span> <span class="n">Integer</span><span class="p">(</span><span class="mi">25</span><span class="p">)]))</span>
<span class="go">[1, 2, 4, 5, 10, 20, 25]</span>
</pre></div>
</div>@@ -9238,8 +9238,8 @@ induced by this poset.</p>
<span class="gp">....:</span> <span class="s1">'d'</span><span class="p">:</span> <span class="p">[</span><span class="s1">'f'</span><span class="p">],</span> <span class="s1">'e'</span><span class="p">:</span> <span class="p">[</span><span class="s1">'f'</span><span class="p">]})</span>
<span class="gp">sage:</span> <span class="n">Q</span> <span class="o">=</span> <span class="n">P</span><span class="o">.</span><span class="n">subposet</span><span class="p">([</span><span class="s1">'a'</span><span class="p">,</span> <span class="s1">'b'</span><span class="p">,</span> <span class="s1">'f'</span><span class="p">]);</span> <span class="n">Q</span>
<span class="go">Finite poset containing 3 elements</span>
-<span class="gp">sage:</span> <span class="n">Q</span><span class="o">.</span><span class="n">cover_relations</span><span class="p">()</span>
-<span class="go">[['b', 'f'], ['a', 'f']]</span>
+<span class="gp">sage:</span> <span class="nb">sorted</span><span class="p">(</span><span class="n">Q</span><span class="o">.</span><span class="n">cover_relations</span><span class="p">())</span>
+<span class="go">[['a', 'f'], ['b', 'f']]</span>
</pre></div>
</div>
</div>@@ -9249,8 +9249,8 @@ induced by this poset.</p>
<span class="gp">...</span> <span class="s1">'d'</span><span class="p">:</span> <span class="p">[</span><span class="s1">'f'</span><span class="p">],</span> <span class="s1">'e'</span><span class="p">:</span> <span class="p">[</span><span class="s1">'f'</span><span class="p">]})</span>
<span class="gp">>>></span> <span class="n">Q</span> <span class="o">=</span> <span class="n">P</span><span class="o">.</span><span class="n">subposet</span><span class="p">([</span><span class="s1">'a'</span><span class="p">,</span> <span class="s1">'b'</span><span class="p">,</span> <span class="s1">'f'</span><span class="p">]);</span> <span class="n">Q</span>
<span class="go">Finite poset containing 3 elements</span>
-<span class="gp">>>></span> <span class="n">Q</span><span class="o">.</span><span class="n">cover_relations</span><span class="p">()</span>
-<span class="go">[['b', 'f'], ['a', 'f']]</span>
+<span class="gp">>>></span> <span class="nb">sorted</span><span class="p">(</span><span class="n">Q</span><span class="o">.</span><span class="n">cover_relations</span><span class="p">())</span>
+<span class="go">[['a', 'f'], ['b', 'f']]</span>
</pre></div>
</div>
</div>html/en/reference/discrete_geometry/sage/geometry/polyhedron/base4.html
diff --git a/html/en/reference/discrete_geometry/sage/geometry/polyhedron/base4.html b/html/en/reference/discrete_geometry/sage/geometry/polyhedron/base4.html
index e562220..f5b0015 100644
--- a/html/en/reference/discrete_geometry/sage/geometry/polyhedron/base4.html
+++ b/html/en/reference/discrete_geometry/sage/geometry/polyhedron/base4.html@@ -567,8 +567,8 @@ inequalities), respectively.</p>
<div class="highlight-ipycon notranslate"><div class="highlight"><pre><span></span><span class="gp">sage:</span> <span class="n">square</span> <span class="o">=</span> <span class="n">polytopes</span><span class="o">.</span><span class="n">hypercube</span><span class="p">(</span><span class="mi">2</span><span class="p">)</span>
<span class="gp">sage:</span> <span class="n">fl</span> <span class="o">=</span> <span class="n">square</span><span class="o">.</span><span class="n">face_lattice</span><span class="p">();</span><span class="n">fl</span>
<span class="go">Finite lattice containing 10 elements</span>
-<span class="gp">sage:</span> <span class="nb">list</span><span class="p">(</span><span class="n">f</span><span class="o">.</span><span class="n">ambient_V_indices</span><span class="p">()</span> <span class="k">for</span> <span class="n">f</span> <span class="ow">in</span> <span class="n">fl</span><span class="p">)</span>
-<span class="go">[(), (0,), (1,), (0, 1), (2,), (1, 2), (3,), (0, 3), (2, 3), (0, 1, 2, 3)]</span>
+<span class="gp">sage:</span> <span class="nb">list</span><span class="p">(</span><span class="n">f</span><span class="o">.</span><span class="n">ambient_V_indices</span><span class="p">()</span> <span class="k">for</span> <span class="n">f</span> <span class="ow">in</span> <span class="nb">sorted</span><span class="p">(</span><span class="n">fl</span><span class="p">))</span>
+<span class="go">[(), (0,), (0, 1), (0, 1, 2, 3), (0, 3), (1,), (1, 2), (2,), (2, 3), (3,)]</span>
<span class="gp">sage:</span> <span class="n">poset_element</span> <span class="o">=</span> <span class="n">fl</span><span class="p">[</span><span class="mi">5</span><span class="p">]</span>
<span class="gp">sage:</span> <span class="n">a_face</span> <span class="o">=</span> <span class="n">poset_element</span>
<span class="gp">sage:</span> <span class="n">a_face</span>@@ -589,8 +589,8 @@ inequalities), respectively.</p>
<span class="gp">>>></span> <span class="n">square</span> <span class="o">=</span> <span class="n">polytopes</span><span class="o">.</span><span class="n">hypercube</span><span class="p">(</span><span class="n">Integer</span><span class="p">(</span><span class="mi">2</span><span class="p">))</span>
<span class="gp">>>></span> <span class="n">fl</span> <span class="o">=</span> <span class="n">square</span><span class="o">.</span><span class="n">face_lattice</span><span class="p">();</span><span class="n">fl</span>
<span class="go">Finite lattice containing 10 elements</span>
-<span class="gp">>>></span> <span class="nb">list</span><span class="p">(</span><span class="n">f</span><span class="o">.</span><span class="n">ambient_V_indices</span><span class="p">()</span> <span class="k">for</span> <span class="n">f</span> <span class="ow">in</span> <span class="n">fl</span><span class="p">)</span>
-<span class="go">[(), (0,), (1,), (0, 1), (2,), (1, 2), (3,), (0, 3), (2, 3), (0, 1, 2, 3)]</span>
+<span class="gp">>>></span> <span class="nb">list</span><span class="p">(</span><span class="n">f</span><span class="o">.</span><span class="n">ambient_V_indices</span><span class="p">()</span> <span class="k">for</span> <span class="n">f</span> <span class="ow">in</span> <span class="nb">sorted</span><span class="p">(</span><span class="n">fl</span><span class="p">))</span>
+<span class="go">[(), (0,), (0, 1), (0, 1, 2, 3), (0, 3), (1,), (1, 2), (2,), (2, 3), (3,)]</span>
<span class="gp">>>></span> <span class="n">poset_element</span> <span class="o">=</span> <span class="n">fl</span><span class="p">[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">5</span><span class="p">)]</span>
<span class="gp">>>></span> <span class="n">a_face</span> <span class="o">=</span> <span class="n">poset_element</span>
<span class="gp">>>></span> <span class="n">a_face</span>html/en/reference/discrete_geometry/sage/geometry/polyhedron/face.html
diff --git a/html/en/reference/discrete_geometry/sage/geometry/polyhedron/face.html b/html/en/reference/discrete_geometry/sage/geometry/polyhedron/face.html
index c027a99..76a96a0 100644
--- a/html/en/reference/discrete_geometry/sage/geometry/polyhedron/face.html
+++ b/html/en/reference/discrete_geometry/sage/geometry/polyhedron/face.html@@ -725,38 +725,36 @@ or an equation.</p>
<div class="tab-set docutils container">
<input checked="True" class="tab-input" id="tab-set--8-input--1" name="tab-set--8" type="radio"><label class="tab-label" for="tab-set--8-input--1">Sage</label><div class="tab-content docutils container">
<div class="highlight-ipycon notranslate"><div class="highlight"><pre><span></span><span class="gp">sage:</span> <span class="n">square</span> <span class="o">=</span> <span class="n">polytopes</span><span class="o">.</span><span class="n">hypercube</span><span class="p">(</span><span class="mi">2</span><span class="p">)</span>
-<span class="gp">sage:</span> <span class="k">for</span> <span class="n">face</span> <span class="ow">in</span> <span class="n">square</span><span class="o">.</span><span class="n">face_lattice</span><span class="p">():</span> <span class="c1"># needs sage.combinat</span>
+<span class="gp">sage:</span> <span class="k">for</span> <span class="n">face</span> <span class="ow">in</span> <span class="nb">sorted</span><span class="p">(</span><span class="n">square</span><span class="o">.</span><span class="n">face_lattice</span><span class="p">()):</span> <span class="c1"># needs sage.combinat</span>
<span class="gp">....:</span> <span class="nb">print</span><span class="p">(</span><span class="n">face</span><span class="o">.</span><span class="n">ambient_Hrepresentation</span><span class="p">())</span>
-<span class="go">(An inequality (-1, 0) x + 1 >= 0, An inequality (0, -1) x + 1 >= 0,</span>
-<span class="go"> An inequality (1, 0) x + 1 >= 0, An inequality (0, 1) x + 1 >= 0)</span>
+<span class="go">(An inequality (-1, 0) x + 1 >= 0, An inequality (0, -1) x + 1 >= 0, An inequality (1, 0) x + 1 >= 0, An inequality (0, 1) x + 1 >= 0)</span>
<span class="go">(An inequality (-1, 0) x + 1 >= 0, An inequality (0, 1) x + 1 >= 0)</span>
-<span class="go">(An inequality (-1, 0) x + 1 >= 0, An inequality (0, -1) x + 1 >= 0)</span>
<span class="go">(An inequality (-1, 0) x + 1 >= 0,)</span>
-<span class="go">(An inequality (0, -1) x + 1 >= 0, An inequality (1, 0) x + 1 >= 0)</span>
-<span class="go">(An inequality (0, -1) x + 1 >= 0,)</span>
-<span class="go">(An inequality (1, 0) x + 1 >= 0, An inequality (0, 1) x + 1 >= 0)</span>
+<span class="go">()</span>
<span class="go">(An inequality (0, 1) x + 1 >= 0,)</span>
+<span class="go">(An inequality (-1, 0) x + 1 >= 0, An inequality (0, -1) x + 1 >= 0)</span>
+<span class="go">(An inequality (0, -1) x + 1 >= 0,)</span>
+<span class="go">(An inequality (0, -1) x + 1 >= 0, An inequality (1, 0) x + 1 >= 0)</span>
<span class="go">(An inequality (1, 0) x + 1 >= 0,)</span>
-<span class="go">()</span>
+<span class="go">(An inequality (1, 0) x + 1 >= 0, An inequality (0, 1) x + 1 >= 0)</span>
</pre></div>
</div>
</div>
<input class="tab-input" id="tab-set--8-input--2" name="tab-set--8" type="radio"><label class="tab-label" for="tab-set--8-input--2">Python</label><div class="tab-content docutils container">
<div class="highlight-ipycon notranslate"><div class="highlight"><pre><span></span><span class="gp">>>></span> <span class="kn">from</span> <span class="nn">sage.all</span> <span class="kn">import</span> <span class="o">*</span>
<span class="gp">>>></span> <span class="n">square</span> <span class="o">=</span> <span class="n">polytopes</span><span class="o">.</span><span class="n">hypercube</span><span class="p">(</span><span class="n">Integer</span><span class="p">(</span><span class="mi">2</span><span class="p">))</span>
-<span class="gp">>>></span> <span class="k">for</span> <span class="n">face</span> <span class="ow">in</span> <span class="n">square</span><span class="o">.</span><span class="n">face_lattice</span><span class="p">():</span> <span class="c1"># needs sage.combinat</span>
+<span class="gp">>>></span> <span class="k">for</span> <span class="n">face</span> <span class="ow">in</span> <span class="nb">sorted</span><span class="p">(</span><span class="n">square</span><span class="o">.</span><span class="n">face_lattice</span><span class="p">()):</span> <span class="c1"># needs sage.combinat</span>
<span class="gp">...</span> <span class="nb">print</span><span class="p">(</span><span class="n">face</span><span class="o">.</span><span class="n">ambient_Hrepresentation</span><span class="p">())</span>
-<span class="go">(An inequality (-1, 0) x + 1 >= 0, An inequality (0, -1) x + 1 >= 0,</span>
-<span class="go"> An inequality (1, 0) x + 1 >= 0, An inequality (0, 1) x + 1 >= 0)</span>
+<span class="go">(An inequality (-1, 0) x + 1 >= 0, An inequality (0, -1) x + 1 >= 0, An inequality (1, 0) x + 1 >= 0, An inequality (0, 1) x + 1 >= 0)</span>
<span class="go">(An inequality (-1, 0) x + 1 >= 0, An inequality (0, 1) x + 1 >= 0)</span>
-<span class="go">(An inequality (-1, 0) x + 1 >= 0, An inequality (0, -1) x + 1 >= 0)</span>
<span class="go">(An inequality (-1, 0) x + 1 >= 0,)</span>
-<span class="go">(An inequality (0, -1) x + 1 >= 0, An inequality (1, 0) x + 1 >= 0)</span>
-<span class="go">(An inequality (0, -1) x + 1 >= 0,)</span>
-<span class="go">(An inequality (1, 0) x + 1 >= 0, An inequality (0, 1) x + 1 >= 0)</span>
+<span class="go">()</span>
<span class="go">(An inequality (0, 1) x + 1 >= 0,)</span>
+<span class="go">(An inequality (-1, 0) x + 1 >= 0, An inequality (0, -1) x + 1 >= 0)</span>
+<span class="go">(An inequality (0, -1) x + 1 >= 0,)</span>
+<span class="go">(An inequality (0, -1) x + 1 >= 0, An inequality (1, 0) x + 1 >= 0)</span>
<span class="go">(An inequality (1, 0) x + 1 >= 0,)</span>
-<span class="go">()</span>
+<span class="go">(An inequality (1, 0) x + 1 >= 0, An inequality (0, 1) x + 1 >= 0)</span>
</pre></div>
</div>
</div>@@ -821,38 +819,36 @@ ray, or a line.</p>
<div class="tab-set docutils container">
<input checked="True" class="tab-input" id="tab-set--10-input--1" name="tab-set--10" type="radio"><label class="tab-label" for="tab-set--10-input--1">Sage</label><div class="tab-content docutils container">
<div class="highlight-ipycon notranslate"><div class="highlight"><pre><span></span><span class="gp">sage:</span> <span class="n">square</span> <span class="o">=</span> <span class="n">polytopes</span><span class="o">.</span><span class="n">hypercube</span><span class="p">(</span><span class="mi">2</span><span class="p">)</span>
-<span class="gp">sage:</span> <span class="k">for</span> <span class="n">fl</span> <span class="ow">in</span> <span class="n">square</span><span class="o">.</span><span class="n">face_lattice</span><span class="p">():</span> <span class="c1"># needs sage.combinat</span>
+<span class="gp">sage:</span> <span class="k">for</span> <span class="n">fl</span> <span class="ow">in</span> <span class="nb">sorted</span><span class="p">(</span><span class="n">square</span><span class="o">.</span><span class="n">face_lattice</span><span class="p">()):</span> <span class="c1"># needs sage.combinat</span>
<span class="gp">....:</span> <span class="nb">print</span><span class="p">(</span><span class="n">fl</span><span class="o">.</span><span class="n">ambient_Vrepresentation</span><span class="p">())</span>
<span class="go">()</span>
<span class="go">(A vertex at (1, -1),)</span>
-<span class="go">(A vertex at (1, 1),)</span>
<span class="go">(A vertex at (1, -1), A vertex at (1, 1))</span>
-<span class="go">(A vertex at (-1, 1),)</span>
-<span class="go">(A vertex at (1, 1), A vertex at (-1, 1))</span>
-<span class="go">(A vertex at (-1, -1),)</span>
+<span class="go">(A vertex at (1, -1), A vertex at (1, 1), A vertex at (-1, 1), A vertex at (-1, -1))</span>
<span class="go">(A vertex at (1, -1), A vertex at (-1, -1))</span>
+<span class="go">(A vertex at (1, 1),)</span>
+<span class="go">(A vertex at (1, 1), A vertex at (-1, 1))</span>
+<span class="go">(A vertex at (-1, 1),)</span>
<span class="go">(A vertex at (-1, 1), A vertex at (-1, -1))</span>
-<span class="go">(A vertex at (1, -1), A vertex at (1, 1),</span>
-<span class="go"> A vertex at (-1, 1), A vertex at (-1, -1))</span>
+<span class="go">(A vertex at (-1, -1),)</span>
</pre></div>
</div>
</div>
<input class="tab-input" id="tab-set--10-input--2" name="tab-set--10" type="radio"><label class="tab-label" for="tab-set--10-input--2">Python</label><div class="tab-content docutils container">
<div class="highlight-ipycon notranslate"><div class="highlight"><pre><span></span><span class="gp">>>></span> <span class="kn">from</span> <span class="nn">sage.all</span> <span class="kn">import</span> <span class="o">*</span>
<span class="gp">>>></span> <span class="n">square</span> <span class="o">=</span> <span class="n">polytopes</span><span class="o">.</span><span class="n">hypercube</span><span class="p">(</span><span class="n">Integer</span><span class="p">(</span><span class="mi">2</span><span class="p">))</span>
-<span class="gp">>>></span> <span class="k">for</span> <span class="n">fl</span> <span class="ow">in</span> <span class="n">square</span><span class="o">.</span><span class="n">face_lattice</span><span class="p">():</span> <span class="c1"># needs sage.combinat</span>
+<span class="gp">>>></span> <span class="k">for</span> <span class="n">fl</span> <span class="ow">in</span> <span class="nb">sorted</span><span class="p">(</span><span class="n">square</span><span class="o">.</span><span class="n">face_lattice</span><span class="p">()):</span> <span class="c1"># needs sage.combinat</span>
<span class="gp">...</span> <span class="nb">print</span><span class="p">(</span><span class="n">fl</span><span class="o">.</span><span class="n">ambient_Vrepresentation</span><span class="p">())</span>
<span class="go">()</span>
<span class="go">(A vertex at (1, -1),)</span>
-<span class="go">(A vertex at (1, 1),)</span>
<span class="go">(A vertex at (1, -1), A vertex at (1, 1))</span>
-<span class="go">(A vertex at (-1, 1),)</span>
-<span class="go">(A vertex at (1, 1), A vertex at (-1, 1))</span>
-<span class="go">(A vertex at (-1, -1),)</span>
+<span class="go">(A vertex at (1, -1), A vertex at (1, 1), A vertex at (-1, 1), A vertex at (-1, -1))</span>
<span class="go">(A vertex at (1, -1), A vertex at (-1, -1))</span>
+<span class="go">(A vertex at (1, 1),)</span>
+<span class="go">(A vertex at (1, 1), A vertex at (-1, 1))</span>
+<span class="go">(A vertex at (-1, 1),)</span>
<span class="go">(A vertex at (-1, 1), A vertex at (-1, -1))</span>
-<span class="go">(A vertex at (1, -1), A vertex at (1, 1),</span>
-<span class="go"> A vertex at (-1, 1), A vertex at (-1, -1))</span>
+<span class="go">(A vertex at (-1, -1),)</span>
</pre></div>
</div>
</div>html/en/reference/graphs/sage/graphs/base/static_sparse_graph.html
diff --git a/html/en/reference/graphs/sage/graphs/base/static_sparse_graph.html b/html/en/reference/graphs/sage/graphs/base/static_sparse_graph.html
index 41c8eef..85c8274 100644
--- a/html/en/reference/graphs/sage/graphs/base/static_sparse_graph.html
+++ b/html/en/reference/graphs/sage/graphs/base/static_sparse_graph.html@@ -391,7 +391,10 @@ elements of <code class="docutils literal notranslate"><span class="pre">edges</
element <code class="docutils literal notranslate"><span class="pre">neighbors[n]</span></code>, which corresponds to no vertex (they are numbered
from <span class="math notranslate nohighlight">\(0\)</span> to <span class="math notranslate nohighlight">\(n-1\)</span>) is present so that it remains easy to enumerate the
neighbors of vertex <span class="math notranslate nohighlight">\(n-1\)</span> : the last of them is the element addressed by
-<code class="docutils literal notranslate"><span class="pre">neighbors[n]-1</span></code>.</p></li>
+<code class="docutils literal notranslate"><span class="pre">neighbors[n]-1</span></code>.
+The arrays <code class="docutils literal notranslate"><span class="pre">neighbors[i]</span></code> are guaranteed to be sorted so the time
+complexity for deciding if <code class="docutils literal notranslate"><span class="pre">g</span></code> has edge <span class="math notranslate nohighlight">\((u, v)\)</span> is <span class="math notranslate nohighlight">\(O(\log{m})\)</span> using
+binary search.</p></li>
<li><p><code class="docutils literal notranslate"><span class="pre">edge_labels</span></code> – list; this cython list associates a label to each edge
of the graph. If a given edge is represented by <code class="docutils literal notranslate"><span class="pre">edges[i]</span></code>, this its
associated label can be found at <code class="docutils literal notranslate"><span class="pre">edge_labels[i]</span></code>. This object is usually@@ -455,7 +458,7 @@ directly in the code.</p></li>
<col style="width: 70.0%" />
</colgroup>
<tbody>
-<tr class="row-odd"><td><p><code class="docutils literal notranslate"><span class="pre">init_short_digraph(short_digraph</span> <span class="pre">g,</span> <span class="pre">G,</span> <span class="pre">edge_labelled,</span> <span class="pre">vertex_list,</span> <span class="pre">sort_neighbors)</span></code></p></td>
+<tr class="row-odd"><td><p><code class="docutils literal notranslate"><span class="pre">init_short_digraph(short_digraph</span> <span class="pre">g,</span> <span class="pre">G,</span> <span class="pre">edge_labelled,</span> <span class="pre">vertex_list)</span></code></p></td>
<td><p>Initialize <code class="docutils literal notranslate"><span class="pre">short_digraph</span> <span class="pre">g</span></code> from a Sage (Di)Graph.</p></td>
</tr>
<tr class="row-even"><td><p><code class="docutils literal notranslate"><span class="pre">int</span> <span class="pre">n_edges(short_digraph</span> <span class="pre">g)</span></code></p></td>html/en/reference/graphs/sage/graphs/convexity_properties.html
diff --git a/html/en/reference/graphs/sage/graphs/convexity_properties.html b/html/en/reference/graphs/sage/graphs/convexity_properties.html
index c19b6d4..8e3a090 100644
--- a/html/en/reference/graphs/sage/graphs/convexity_properties.html
+++ b/html/en/reference/graphs/sage/graphs/convexity_properties.html@@ -609,11 +609,9 @@ follow the terminology of the domain. See for instance <a class="reference inter
each vertex <span class="math notranslate nohighlight">\(u \in S\)</span>, the algorithm first performs a breadth first search
from <span class="math notranslate nohighlight">\(u\)</span> to get distances, and then identifies the vertices of <span class="math notranslate nohighlight">\(G\)</span> lying on
a shortest path from <span class="math notranslate nohighlight">\(u\)</span> to any <span class="math notranslate nohighlight">\(v\in S\)</span> using a reversal traversal from
-vertices in <span class="math notranslate nohighlight">\(S\)</span>. This algorithm has time complexity in
-<span class="math notranslate nohighlight">\(O(|S|(n + m) + (n + m\log{m}))\)</span> for <code class="docutils literal notranslate"><span class="pre">SparseGraph</span></code>,
-<span class="math notranslate nohighlight">\(O(|S|(n + m) + n^2\log{m})\)</span> for <code class="docutils literal notranslate"><span class="pre">DenseGraph</span></code> and space complexity in
-<span class="math notranslate nohighlight">\(O(n + m)\)</span> (the extra <span class="math notranslate nohighlight">\(\log\)</span> factor is due to <code class="docutils literal notranslate"><span class="pre">init_short_digraph</span></code> being
-called with <code class="docutils literal notranslate"><span class="pre">sort_neighbors=True</span></code>).</p>
+vertices in <span class="math notranslate nohighlight">\(S\)</span>. This algorithm has time complexity in <span class="math notranslate nohighlight">\(O(|S|(n + m))\)</span> for
+<code class="docutils literal notranslate"><span class="pre">SparseGraph</span></code>, <span class="math notranslate nohighlight">\(O(|S|(n + m) + n^2)\)</span> for <code class="docutils literal notranslate"><span class="pre">DenseGraph</span></code> and
+space complexity in <span class="math notranslate nohighlight">\(O(n + m)\)</span>.</p>
<p>INPUT:</p>
<ul class="simple">
<li><p><code class="docutils literal notranslate"><span class="pre">G</span></code> – a Sage graph</p></li>html/en/reference/graphs/sage/graphs/distances_all_pairs.html
diff --git a/html/en/reference/graphs/sage/graphs/distances_all_pairs.html b/html/en/reference/graphs/sage/graphs/distances_all_pairs.html
index dc30771..ee20658 100644
--- a/html/en/reference/graphs/sage/graphs/distances_all_pairs.html
+++ b/html/en/reference/graphs/sage/graphs/distances_all_pairs.html@@ -1408,15 +1408,6 @@ complexity in <span class="math notranslate nohighlight">\(O(n^2)\)</span>. It c
<code class="docutils literal notranslate"><span class="pre">'high'</span></code> algorithm for digraphs.</p>
</li>
</ul>
-<div class="admonition note">
-<p class="admonition-title">Note</p>
-<p>As the graph is converted to a short_digraph, the complexity for the
-case <code class="docutils literal notranslate"><span class="pre">algorithm</span> <span class="pre">==</span> <span class="pre">"high"</span></code> has an extra <span class="math notranslate nohighlight">\(O(m+n)\)</span> for <code class="docutils literal notranslate"><span class="pre">SparseGraph</span></code>
-and <span class="math notranslate nohighlight">\(O(n^2)\)</span> for <code class="docutils literal notranslate"><span class="pre">DenseGraph</span></code>. If <code class="docutils literal notranslate"><span class="pre">algorithm</span>  <span class="pre">==</span> <span class="pre">"low"</span></code>, the extra
-complexity is <span class="math notranslate nohighlight">\(O(n + m\log{m})\)</span> for <code class="docutils literal notranslate"><span class="pre">SparseGraph</span></code> and <span class="math notranslate nohighlight">\(O(n^2\log{m})\)</span>
-for <code class="docutils literal notranslate"><span class="pre">DenseGraph</span></code> (because <code class="docutils literal notranslate"><span class="pre">init_short_digraph</span></code> is called with
-<code class="docutils literal notranslate"><span class="pre">sort_neighbors=True</span></code>).</p>
-</div>
<p>EXAMPLES:</p>
<p>True for any connected graph <a class="reference internal" href="../../../references/index.html#krg1996" id="id12"><span>[KRG1996]</span></a>:</p>
<div class="tab-set docutils container">html/en/reference/graphs/sage/graphs/generic_graph.html
diff --git a/html/en/reference/graphs/sage/graphs/generic_graph.html b/html/en/reference/graphs/sage/graphs/generic_graph.html
index 8c4be99..876694d 100644
--- a/html/en/reference/graphs/sage/graphs/generic_graph.html
+++ b/html/en/reference/graphs/sage/graphs/generic_graph.html@@ -28079,15 +28079,6 @@ complexity in <span class="math notranslate nohighlight">\(O(n^2)\)</span>. It c
<code class="docutils literal notranslate"><span class="pre">'high'</span></code> algorithm for digraphs.</p>
</li>
</ul>
-<div class="admonition note">
-<p class="admonition-title">Note</p>
-<p>As the graph is converted to a short_digraph, the complexity for the
-case <code class="docutils literal notranslate"><span class="pre">algorithm</span> <span class="pre">==</span> <span class="pre">"high"</span></code> has an extra <span class="math notranslate nohighlight">\(O(m+n)\)</span> for <code class="docutils literal notranslate"><span class="pre">SparseGraph</span></code>
-and <span class="math notranslate nohighlight">\(O(n^2)\)</span> for <code class="docutils literal notranslate"><span class="pre">DenseGraph</span></code>. If <code class="docutils literal notranslate"><span class="pre">algorithm</span>  <span class="pre">==</span> <span class="pre">"low"</span></code>, the extra
-complexity is <span class="math notranslate nohighlight">\(O(n + m\log{m})\)</span> for <code class="docutils literal notranslate"><span class="pre">SparseGraph</span></code> and <span class="math notranslate nohighlight">\(O(n^2\log{m})\)</span>
-for <code class="docutils literal notranslate"><span class="pre">DenseGraph</span></code> (because <code class="docutils literal notranslate"><span class="pre">init_short_digraph</span></code> is called with
-<code class="docutils literal notranslate"><span class="pre">sort_neighbors=True</span></code>).</p>
-</div>
<p>EXAMPLES:</p>
<p>True for any connected graph <a class="reference internal" href="../../../references/index.html#krg1996" id="id45"><span>[KRG1996]</span></a>:</p>
<div class="tab-set docutils container">html/en/reference/graphs/sage/graphs/graph.html
diff --git a/html/en/reference/graphs/sage/graphs/graph.html b/html/en/reference/graphs/sage/graphs/graph.html
index cf7e921..9e381b5 100644
--- a/html/en/reference/graphs/sage/graphs/graph.html
+++ b/html/en/reference/graphs/sage/graphs/graph.html@@ -3004,13 +3004,6 @@ upon the algorithm proposed in <a class="reference internal" href="../../../refe
clique minimal separators of a graph. This algorithm is based on the
<a class="reference internal" href="traversals.html#sage.graphs.traversals.maximum_cardinality_search_M" title="sage.graphs.traversals.maximum_cardinality_search_M"><code class="xref py py-meth docutils literal notranslate"><span class="pre">maximum_cardinality_search_M()</span></code></a> graph traversal
and has time complexity in <span class="math notranslate nohighlight">\(O(|V|\cdot|E|)\)</span>.</p>
-<div class="admonition note">
-<p class="admonition-title">Note</p>
-<p>As the graph is converted to a short_digraph (with
-<code class="docutils literal notranslate"><span class="pre">sort_neighbors=True</span></code>), the complexity has an extra
-<span class="math notranslate nohighlight">\(O(|V|+|E|\log{|E|})\)</span> for <code class="docutils literal notranslate"><span class="pre">SparseGraph</span></code> and <span class="math notranslate nohighlight">\(O(|V|^2\log{|E|})\)</span> for
-<code class="docutils literal notranslate"><span class="pre">DenseGraph</span></code>.</p>
-</div>
<p>If the graph is not connected, we insert empty separators between the lists
of separators of each connected components. See the examples below for more
details.</p>@@ -7665,11 +7658,9 @@ follow the terminology of the domain. See for instance <a class="reference inter
each vertex <span class="math notranslate nohighlight">\(u \in S\)</span>, the algorithm first performs a breadth first search
from <span class="math notranslate nohighlight">\(u\)</span> to get distances, and then identifies the vertices of <span class="math notranslate nohighlight">\(G\)</span> lying on
a shortest path from <span class="math notranslate nohighlight">\(u\)</span> to any <span class="math notranslate nohighlight">\(v\in S\)</span> using a reversal traversal from
-vertices in <span class="math notranslate nohighlight">\(S\)</span>. This algorithm has time complexity in
-<span class="math notranslate nohighlight">\(O(|S|(n + m) + (n + m\log{m}))\)</span> for <code class="docutils literal notranslate"><span class="pre">SparseGraph</span></code>,
-<span class="math notranslate nohighlight">\(O(|S|(n + m) + n^2\log{m})\)</span> for <code class="docutils literal notranslate"><span class="pre">DenseGraph</span></code> and space complexity in
-<span class="math notranslate nohighlight">\(O(n + m)\)</span> (the extra <span class="math notranslate nohighlight">\(\log\)</span> factor is due to <code class="docutils literal notranslate"><span class="pre">init_short_digraph</span></code> being
-called with <code class="docutils literal notranslate"><span class="pre">sort_neighbors=True</span></code>).</p>
+vertices in <span class="math notranslate nohighlight">\(S\)</span>. This algorithm has time complexity in <span class="math notranslate nohighlight">\(O(|S|(n + m))\)</span> for
+<code class="docutils literal notranslate"><span class="pre">SparseGraph</span></code>, <span class="math notranslate nohighlight">\(O(|S|(n + m) + n^2)\)</span> for <code class="docutils literal notranslate"><span class="pre">DenseGraph</span></code> and
+space complexity in <span class="math notranslate nohighlight">\(O(n + m)\)</span>.</p>
<p>INPUT:</p>
<ul class="simple">
<li><p><code class="docutils literal notranslate"><span class="pre">G</span></code> – a Sage graph</p></li>@@ -11829,9 +11820,9 @@ forbidden subgraph H, this graph is returned.</p></li>
<p>This algorithm checks whether the graph <code class="docutils literal notranslate"><span class="pre">g</span></code> or its complement
contain an induced cycle of length at least 5.</p>
<p>Using is_long_hole_free() and is_long_antihole_free() yields a run time
-of <span class="math notranslate nohighlight">\(O(n+m^2)\)</span> for <code class="docutils literal notranslate"><span class="pre">SparseGraph</span></code> and <span class="math notranslate nohighlight">\(O(n^2\log{m} + m^2)\)</span> for
-<code class="docutils literal notranslate"><span class="pre">DenseGraph</span></code> (where <span class="math notranslate nohighlight">\(n\)</span> is the number of vertices and <span class="math notranslate nohighlight">\(m\)</span> is the number of
-edges of the graph).</p>
+of <span class="math notranslate nohighlight">\(O(n+m^2)\)</span> for <code class="docutils literal notranslate"><span class="pre">SparseGraph</span></code> and <span class="math notranslate nohighlight">\(O(n^2 + m^2)\)</span> for <code class="docutils literal notranslate"><span class="pre">DenseGraph</span></code>
+(where <span class="math notranslate nohighlight">\(n\)</span> is the number of vertices and <span class="math notranslate nohighlight">\(m\)</span> is the number of edges of the
+graph).</p>
<p>EXAMPLES:</p>
<p>The Petersen Graph is not weakly chordal and contains a hole:</p>
<div class="tab-set docutils container">html/en/reference/graphs/sage/graphs/graph_decompositions/clique_separators.html
diff --git a/html/en/reference/graphs/sage/graphs/graph_decompositions/clique_separators.html b/html/en/reference/graphs/sage/graphs/graph_decompositions/clique_separators.html
index 4b2acc2..ead5390 100644
--- a/html/en/reference/graphs/sage/graphs/graph_decompositions/clique_separators.html
+++ b/html/en/reference/graphs/sage/graphs/graph_decompositions/clique_separators.html@@ -377,13 +377,6 @@ upon the algorithm proposed in <a class="reference internal" href="../../../../r
clique minimal separators of a graph. This algorithm is based on the
<a class="reference internal" href="../traversals.html#sage.graphs.traversals.maximum_cardinality_search_M" title="sage.graphs.traversals.maximum_cardinality_search_M"><code class="xref py py-meth docutils literal notranslate"><span class="pre">maximum_cardinality_search_M()</span></code></a> graph traversal
and has time complexity in <span class="math notranslate nohighlight">\(O(|V|\cdot|E|)\)</span>.</p>
-<div class="admonition note">
-<p class="admonition-title">Note</p>
-<p>As the graph is converted to a short_digraph (with
-<code class="docutils literal notranslate"><span class="pre">sort_neighbors=True</span></code>), the complexity has an extra
-<span class="math notranslate nohighlight">\(O(|V|+|E|\log{|E|})\)</span> for <code class="docutils literal notranslate"><span class="pre">SparseGraph</span></code> and <span class="math notranslate nohighlight">\(O(|V|^2\log{|E|})\)</span> for
-<code class="docutils literal notranslate"><span class="pre">DenseGraph</span></code>.</p>
-</div>
<p>If the graph is not connected, we insert empty separators between the lists
of separators of each connected components. See the examples below for more
details.</p>html/en/reference/graphs/sage/graphs/weakly_chordal.html
diff --git a/html/en/reference/graphs/sage/graphs/weakly_chordal.html b/html/en/reference/graphs/sage/graphs/weakly_chordal.html
index 7cfdbcd..9c85057 100644
--- a/html/en/reference/graphs/sage/graphs/weakly_chordal.html
+++ b/html/en/reference/graphs/sage/graphs/weakly_chordal.html@@ -563,9 +563,9 @@ forbidden subgraph H, this graph is returned.</p></li>
<p>This algorithm checks whether the graph <code class="docutils literal notranslate"><span class="pre">g</span></code> or its complement
contain an induced cycle of length at least 5.</p>
<p>Using is_long_hole_free() and is_long_antihole_free() yields a run time
-of <span class="math notranslate nohighlight">\(O(n+m^2)\)</span> for <code class="docutils literal notranslate"><span class="pre">SparseGraph</span></code> and <span class="math notranslate nohighlight">\(O(n^2\log{m} + m^2)\)</span> for
-<code class="docutils literal notranslate"><span class="pre">DenseGraph</span></code> (where <span class="math notranslate nohighlight">\(n\)</span> is the number of vertices and <span class="math notranslate nohighlight">\(m\)</span> is the number of
-edges of the graph).</p>
+of <span class="math notranslate nohighlight">\(O(n+m^2)\)</span> for <code class="docutils literal notranslate"><span class="pre">SparseGraph</span></code> and <span class="math notranslate nohighlight">\(O(n^2 + m^2)\)</span> for <code class="docutils literal notranslate"><span class="pre">DenseGraph</span></code>
+(where <span class="math notranslate nohighlight">\(n\)</span> is the number of vertices and <span class="math notranslate nohighlight">\(m\)</span> is the number of edges of the
+graph).</p>
<p>EXAMPLES:</p>
<p>The Petersen Graph is not weakly chordal and contains a hole:</p>
<div class="tab-set docutils container">html/en/reference/matrices/sage/matrix/matrix2.html
diff --git a/html/en/reference/matrices/sage/matrix/matrix2.html b/html/en/reference/matrices/sage/matrix/matrix2.html
index bb7d492..d2b690d 100644
--- a/html/en/reference/matrices/sage/matrix/matrix2.html
+++ b/html/en/reference/matrices/sage/matrix/matrix2.html@@ -11667,14 +11667,9 @@ matrix:</p>
<div class="highlight-ipycon notranslate"><div class="highlight"><pre><span></span><span class="gp">sage:</span> <span class="c1"># needs sage.combinat sage.graphs sage.rings.finite_rings</span>
<span class="gp">sage:</span> <span class="n">cox</span> <span class="o">=</span> <span class="n">posets</span><span class="o">.</span><span class="n">TamariLattice</span><span class="p">(</span><span class="mi">3</span><span class="p">)</span><span class="o">.</span><span class="n">coxeter_transformation</span><span class="p">()</span>
<span class="gp">sage:</span> <span class="n">M</span> <span class="o">=</span> <span class="n">cox</span><span class="o">.</span><span class="n">change_ring</span><span class="p">(</span><span class="n">GF</span><span class="p">(</span><span class="mi">3</span><span class="p">))</span>
-<span class="gp">sage:</span> <span class="n">M</span><span class="o">.</span><span class="n">is_similar</span><span class="p">(</span><span class="n">M</span><span class="o">**</span><span class="mi">3</span><span class="p">,</span> <span class="kc">True</span><span class="p">)</span> <span class="c1"># long time</span>
-<span class="go">(</span>
-<span class="go"> [1 0 0 0 0]</span>
-<span class="go"> [0 1 1 0 2]</span>
-<span class="go"> [0 0 0 0 1]</span>
-<span class="go"> [1 2 0 2 1]</span>
-<span class="go">True, [0 0 1 0 0]</span>
-<span class="go">)</span>
+<span class="gp">sage:</span> <span class="n">b</span><span class="p">,</span> <span class="n">S</span> <span class="o">=</span> <span class="n">M</span><span class="o">.</span><span class="n">is_similar</span><span class="p">(</span><span class="n">M</span><span class="o">**</span><span class="mi">3</span><span class="p">,</span> <span class="kc">True</span><span class="p">)</span> <span class="c1"># long time</span>
+<span class="gp">sage:</span> <span class="n">b</span><span class="p">,</span> <span class="n">S</span><span class="o">.</span><span class="n">inverse</span><span class="p">()</span><span class="o">*</span><span class="p">(</span><span class="n">M</span><span class="o">**</span><span class="mi">3</span><span class="p">)</span><span class="o">*</span><span class="n">S</span> <span class="o">==</span> <span class="n">M</span> <span class="c1"># long time</span>
+<span class="go">(True, True)</span>
</pre></div>
</div>
</div>@@ -11683,14 +11678,9 @@ matrix:</p>
<span class="gp">>>></span> <span class="c1"># needs sage.combinat sage.graphs sage.rings.finite_rings</span>
<span class="gp">>>></span> <span class="n">cox</span> <span class="o">=</span> <span class="n">posets</span><span class="o">.</span><span class="n">TamariLattice</span><span class="p">(</span><span class="n">Integer</span><span class="p">(</span><span class="mi">3</span><span class="p">))</span><span class="o">.</span><span class="n">coxeter_transformation</span><span class="p">()</span>
<span class="gp">>>></span> <span class="n">M</span> <span class="o">=</span> <span class="n">cox</span><span class="o">.</span><span class="n">change_ring</span><span class="p">(</span><span class="n">GF</span><span class="p">(</span><span class="n">Integer</span><span class="p">(</span><span class="mi">3</span><span class="p">)))</span>
-<span class="gp">>>></span> <span class="n">M</span><span class="o">.</span><span class="n">is_similar</span><span class="p">(</span><span class="n">M</span><span class="o">**</span><span class="n">Integer</span><span class="p">(</span><span class="mi">3</span><span class="p">),</span> <span class="kc">True</span><span class="p">)</span> <span class="c1"># long time</span>
-<span class="go">(</span>
-<span class="go"> [1 0 0 0 0]</span>
-<span class="go"> [0 1 1 0 2]</span>
-<span class="go"> [0 0 0 0 1]</span>
-<span class="go"> [1 2 0 2 1]</span>
-<span class="go">True, [0 0 1 0 0]</span>
-<span class="go">)</span>
+<span class="gp">>>></span> <span class="n">b</span><span class="p">,</span> <span class="n">S</span> <span class="o">=</span> <span class="n">M</span><span class="o">.</span><span class="n">is_similar</span><span class="p">(</span><span class="n">M</span><span class="o">**</span><span class="n">Integer</span><span class="p">(</span><span class="mi">3</span><span class="p">),</span> <span class="kc">True</span><span class="p">)</span> <span class="c1"># long time</span>
+<span class="gp">>>></span> <span class="n">b</span><span class="p">,</span> <span class="n">S</span><span class="o">.</span><span class="n">inverse</span><span class="p">()</span><span class="o">*</span><span class="p">(</span><span class="n">M</span><span class="o">**</span><span class="n">Integer</span><span class="p">(</span><span class="mi">3</span><span class="p">))</span><span class="o">*</span><span class="n">S</span> <span class="o">==</span> <span class="n">M</span> <span class="c1"># long time</span>
+<span class="go">(True, True)</span>
</pre></div>
</div>
</div>html/en/reference/quivers/sage/quivers/ar_quiver.html
diff --git a/html/en/reference/quivers/sage/quivers/ar_quiver.html b/html/en/reference/quivers/sage/quivers/ar_quiver.html
index 07076c0..f60576b 100644
--- a/html/en/reference/quivers/sage/quivers/ar_quiver.html
+++ b/html/en/reference/quivers/sage/quivers/ar_quiver.html@@ -335,7 +335,7 @@ when the quiver is not a finite type Dynkin quiver.</p>
<input checked="True" class="tab-input" id="tab-set--0-input--1" name="tab-set--0" type="radio"><label class="tab-label" for="tab-set--0-input--1">Sage</label><div class="tab-content docutils container">
<div class="highlight-ipycon notranslate"><div class="highlight"><pre><span></span><span class="gp">sage:</span> <span class="n">DA</span> <span class="o">=</span> <span class="n">DiGraph</span><span class="p">([[</span><span class="mi">1</span><span class="p">,</span> <span class="mi">2</span><span class="p">],</span> <span class="p">[</span><span class="mi">2</span><span class="p">,</span> <span class="mi">3</span><span class="p">]])</span>
<span class="gp">sage:</span> <span class="n">AR</span> <span class="o">=</span> <span class="n">DA</span><span class="o">.</span><span class="n">auslander_reiten_quiver</span><span class="p">()</span>
-<span class="gp">sage:</span> <span class="n">AR</span><span class="o">.</span><span class="n">digraph</span><span class="p">()</span><span class="o">.</span><span class="n">edges</span><span class="p">(</span><span class="n">labels</span><span class="o">=</span><span class="kc">False</span><span class="p">)</span>
+<span class="gp">sage:</span> <span class="n">AR</span><span class="o">.</span><span class="n">digraph</span><span class="p">()</span><span class="o">.</span><span class="n">edges</span><span class="p">(</span><span class="n">labels</span><span class="o">=</span><span class="kc">False</span><span class="p">,</span><span class="n">sort</span><span class="o">=</span><span class="kc">True</span><span class="p">,</span><span class="n">sort_vertices</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
<span class="go">[(<1, 1>, <2, 2>), (<2, 1>, <1, 1>), (<2, 1>, <3, 2>), (<3, 1>, <2, 1>),</span>
<span class="go"> (<2, 2>, <3, 3>), (<3, 2>, <2, 2>)]</span>@@ -363,7 +363,7 @@ when the quiver is not a finite type Dynkin quiver.</p>
<div class="highlight-ipycon notranslate"><div class="highlight"><pre><span></span><span class="gp">>>></span> <span class="kn">from</span> <span class="nn">sage.all</span> <span class="kn">import</span> <span class="o">*</span>
<span class="gp">>>></span> <span class="n">DA</span> <span class="o">=</span> <span class="n">DiGraph</span><span class="p">([[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">1</span><span class="p">),</span> <span class="n">Integer</span><span class="p">(</span><span class="mi">2</span><span class="p">)],</span> <span class="p">[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">2</span><span class="p">),</span> <span class="n">Integer</span><span class="p">(</span><span class="mi">3</span><span class="p">)]])</span>
<span class="gp">>>></span> <span class="n">AR</span> <span class="o">=</span> <span class="n">DA</span><span class="o">.</span><span class="n">auslander_reiten_quiver</span><span class="p">()</span>
-<span class="gp">>>></span> <span class="n">AR</span><span class="o">.</span><span class="n">digraph</span><span class="p">()</span><span class="o">.</span><span class="n">edges</span><span class="p">(</span><span class="n">labels</span><span class="o">=</span><span class="kc">False</span><span class="p">)</span>
+<span class="gp">>>></span> <span class="n">AR</span><span class="o">.</span><span class="n">digraph</span><span class="p">()</span><span class="o">.</span><span class="n">edges</span><span class="p">(</span><span class="n">labels</span><span class="o">=</span><span class="kc">False</span><span class="p">,</span><span class="n">sort</span><span class="o">=</span><span class="kc">True</span><span class="p">,</span><span class="n">sort_vertices</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
<span class="go">[(<1, 1>, <2, 2>), (<2, 1>, <1, 1>), (<2, 1>, <3, 2>), (<3, 1>, <2, 1>),</span>
<span class="go"> (<2, 2>, <3, 3>), (<3, 2>, <2, 2>)]</span>@@ -702,7 +702,7 @@ include the arrows corresponding to the translations</p></li>
<div class="highlight-ipycon notranslate"><div class="highlight"><pre><span></span><span class="gp">sage:</span> <span class="n">D</span> <span class="o">=</span> <span class="n">DiGraph</span><span class="p">([[</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="s1">'a'</span><span class="p">],</span> <span class="p">[</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="s1">'b'</span><span class="p">]],</span> <span class="n">multiedges</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
<span class="gp">sage:</span> <span class="n">AR</span> <span class="o">=</span> <span class="n">D</span><span class="o">.</span><span class="n">auslander_reiten_quiver</span><span class="p">()</span>
<span class="gp">sage:</span> <span class="n">G</span> <span class="o">=</span> <span class="n">AR</span><span class="o">.</span><span class="n">digraph_postinjectives</span><span class="p">(</span><span class="mi">3</span><span class="p">)</span>
-<span class="gp">sage:</span> <span class="p">[</span><span class="n">node</span><span class="o">.</span><span class="n">dimension_vector</span><span class="p">()</span> <span class="k">for</span> <span class="n">node</span> <span class="ow">in</span> <span class="n">G</span><span class="p">]</span>
+<span class="gp">sage:</span> <span class="p">[</span><span class="n">node</span><span class="o">.</span><span class="n">dimension_vector</span><span class="p">()</span> <span class="k">for</span> <span class="n">node</span> <span class="ow">in</span> <span class="nb">sorted</span><span class="p">(</span><span class="n">G</span><span class="p">)]</span>
<span class="go">[5*v1 + 4*v2, 6*v1 + 5*v2, 3*v1 + 2*v2, 4*v1 + 3*v2, v1, 2*v1 + v2]</span>
<span class="gp">sage:</span> <span class="n">AR</span><span class="o">.</span><span class="n">digraph_postinjectives</span><span class="p">(</span><span class="mi">0</span><span class="p">)</span>
<span class="go">Digraph on 0 vertices</span>@@ -714,7 +714,7 @@ include the arrows corresponding to the translations</p></li>
<span class="gp">>>></span> <span class="n">D</span> <span class="o">=</span> <span class="n">DiGraph</span><span class="p">([[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">1</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">2</span><span class="p">),</span><span class="s1">'a'</span><span class="p">],</span> <span class="p">[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">1</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">2</span><span class="p">),</span><span class="s1">'b'</span><span class="p">]],</span> <span class="n">multiedges</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
<span class="gp">>>></span> <span class="n">AR</span> <span class="o">=</span> <span class="n">D</span><span class="o">.</span><span class="n">auslander_reiten_quiver</span><span class="p">()</span>
<span class="gp">>>></span> <span class="n">G</span> <span class="o">=</span> <span class="n">AR</span><span class="o">.</span><span class="n">digraph_postinjectives</span><span class="p">(</span><span class="n">Integer</span><span class="p">(</span><span class="mi">3</span><span class="p">))</span>
-<span class="gp">>>></span> <span class="p">[</span><span class="n">node</span><span class="o">.</span><span class="n">dimension_vector</span><span class="p">()</span> <span class="k">for</span> <span class="n">node</span> <span class="ow">in</span> <span class="n">G</span><span class="p">]</span>
+<span class="gp">>>></span> <span class="p">[</span><span class="n">node</span><span class="o">.</span><span class="n">dimension_vector</span><span class="p">()</span> <span class="k">for</span> <span class="n">node</span> <span class="ow">in</span> <span class="nb">sorted</span><span class="p">(</span><span class="n">G</span><span class="p">)]</span>
<span class="go">[5*v1 + 4*v2, 6*v1 + 5*v2, 3*v1 + 2*v2, 4*v1 + 3*v2, v1, 2*v1 + v2]</span>
<span class="gp">>>></span> <span class="n">AR</span><span class="o">.</span><span class="n">digraph_postinjectives</span><span class="p">(</span><span class="n">Integer</span><span class="p">(</span><span class="mi">0</span><span class="p">))</span>
<span class="go">Digraph on 0 vertices</span>@@ -734,7 +734,7 @@ include the arrows corresponding to the translations</p></li>
<div class="highlight-ipycon notranslate"><div class="highlight"><pre><span></span><span class="gp">sage:</span> <span class="n">D</span> <span class="o">=</span> <span class="n">DiGraph</span><span class="p">([[</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="s1">'a'</span><span class="p">],</span> <span class="p">[</span><span class="mi">1</span><span class="p">,</span><span class="mi">2</span><span class="p">,</span><span class="s1">'b'</span><span class="p">]],</span> <span class="n">multiedges</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
<span class="gp">sage:</span> <span class="n">AR</span> <span class="o">=</span> <span class="n">D</span><span class="o">.</span><span class="n">auslander_reiten_quiver</span><span class="p">()</span>
<span class="gp">sage:</span> <span class="n">G</span> <span class="o">=</span> <span class="n">AR</span><span class="o">.</span><span class="n">digraph_preprojectives</span><span class="p">(</span><span class="mi">3</span><span class="p">)</span>
-<span class="gp">sage:</span> <span class="p">[</span><span class="n">node</span><span class="o">.</span><span class="n">dimension_vector</span><span class="p">()</span> <span class="k">for</span> <span class="n">node</span> <span class="ow">in</span> <span class="n">G</span><span class="p">]</span>
+<span class="gp">sage:</span> <span class="p">[</span><span class="n">node</span><span class="o">.</span><span class="n">dimension_vector</span><span class="p">()</span> <span class="k">for</span> <span class="n">node</span> <span class="ow">in</span> <span class="nb">sorted</span><span class="p">(</span><span class="n">G</span><span class="p">)]</span>
<span class="go">[v1 + 2*v2, v2, 3*v1 + 4*v2, 2*v1 + 3*v2, 5*v1 + 6*v2, 4*v1 + 5*v2]</span>
<span class="gp">sage:</span> <span class="n">AR</span><span class="o">.</span><span class="n">digraph_preprojectives</span><span class="p">(</span><span class="mi">0</span><span class="p">)</span>
<span class="go">Digraph on 0 vertices</span>@@ -746,7 +746,7 @@ include the arrows corresponding to the translations</p></li>
<span class="gp">>>></span> <span class="n">D</span> <span class="o">=</span> <span class="n">DiGraph</span><span class="p">([[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">1</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">2</span><span class="p">),</span><span class="s1">'a'</span><span class="p">],</span> <span class="p">[</span><span class="n">Integer</span><span class="p">(</span><span class="mi">1</span><span class="p">),</span><span class="n">Integer</span><span class="p">(</span><span class="mi">2</span><span class="p">),</span><span class="s1">'b'</span><span class="p">]],</span> <span class="n">multiedges</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
<span class="gp">>>></span> <span class="n">AR</span> <span class="o">=</span> <span class="n">D</span><span class="o">.</span><span class="n">auslander_reiten_quiver</span><span class="p">()</span>
<span class="gp">>>></span> <span class="n">G</span> <span class="o">=</span> <span class="n">AR</span><span class="o">.</span><span class="n">digraph_preprojectives</span><span class="p">(</span><span class="n">Integer</span><span class="p">(</span><span class="mi">3</span><span class="p">))</span>
-<span class="gp">>>></span> <span class="p">[</span><span class="n">node</span><span class="o">.</span><span class="n">dimension_vector</span><span class="p">()</span> <span class="k">for</span> <span class="n">node</span> <span class="ow">in</span> <span class="n">G</span><span class="p">]</span>
+<span class="gp">>>></span> <span class="p">[</span><span class="n">node</span><span class="o">.</span><span class="n">dimension_vector</span><span class="p">()</span> <span class="k">for</span> <span class="n">node</span> <span class="ow">in</span> <span class="nb">sorted</span><span class="p">(</span><span class="n">G</span><span class="p">)]</span>
<span class="go">[v1 + 2*v2, v2, 3*v1 + 4*v2, 2*v1 + 3*v2, 5*v1 + 6*v2, 4*v1 + 5*v2]</span>
<span class="gp">>>></span> <span class="n">AR</span><span class="o">.</span><span class="n">digraph_preprojectives</span><span class="p">(</span><span class="n">Integer</span><span class="p">(</span><span class="mi">0</span><span class="p">))</span>
<span class="go">Digraph on 0 vertices</span>html/en/reference/repl/options.html
diff --git a/html/en/reference/repl/options.html b/html/en/reference/repl/options.html
index 72881c3..71fa204 100644
--- a/html/en/reference/repl/options.html
+++ b/html/en/reference/repl/options.html@@ -501,7 +501,6 @@ Installation Guide for information about making sure your
<span class="go"> a Jupyter notebook (.ipynb).</span>
<span class="go"> --sws2rst <sws doc> -- Generates a reStructuredText source file from</span>
<span class="go"> a Sage worksheet (.sws) document.</span>
-<span class="go"> (not installed currently, run sage -i sage_sws2rst)</span>
<span class="go">Valgrind memory debugging:</span>