@@ -4545,7 +4545,7 @@ def name(self, style="singular"):
4545
4545
_SupportedFindStatCollection (lambda x : (lambda E , V : Graph ([list (range (V )),
4546
4546
lambda i ,j : (i ,j ) in E or (j ,i ) in E ],
4547
4547
immutable = True ))(* literal_eval (x )),
4548
- lambda X : str ((sorted ( X .edges (labels = False ) ), X .num_verts ())),
4548
+ lambda X : str ((X .edges (labels = False , sort = True ), X .num_verts ())),
4549
4549
lambda x : (g .copy (immutable = True ) for g in graphs (x , copy = False )),
4550
4550
lambda x : x .num_verts (),
4551
4551
lambda x : isinstance (x , Graph )),
@@ -4767,13 +4767,13 @@ def _element_constructor_(self, entry):
4767
4767
4768
4768
sage: cc = FindStatCollection(graphs(3)); cc # optional -- internet
4769
4769
a subset of Cc0020: Graphs
4770
- sage: cc.first_terms(lambda x: x.edges(labels=False)).list() # optional -- internet
4770
+ sage: cc.first_terms(lambda x: x.edges(labels=False, sort=True )).list() # optional -- internet
4771
4771
[(Graph on 3 vertices, []),
4772
4772
(Graph on 3 vertices, [(0, 2)]),
4773
4773
(Graph on 3 vertices, [(0, 2), (1, 2)]),
4774
4774
(Graph on 3 vertices, [(0, 1), (0, 2), (1, 2)])]
4775
4775
4776
- sage: len(cc.first_terms(lambda x: x.edges(labels=False)).list()) # optional -- internet
4776
+ sage: len(cc.first_terms(lambda x: x.edges(labels=False, sort=False )).list()) # optional -- internet
4777
4777
4
4778
4778
"""
4779
4779
if isinstance (entry , self .Element ):
0 commit comments