Skip to content

Commit ddad107

Browse files
committed
#38842: make doctests more robusts
1 parent 864bcdb commit ddad107

File tree

1 file changed

+8
-12
lines changed

1 file changed

+8
-12
lines changed

src/sage/graphs/bipartite_graph.py

Lines changed: 8 additions & 12 deletions
Original file line numberDiff line numberDiff line change
@@ -2638,20 +2638,16 @@ class by some canonization function `c`. If `G` and `H` are graphs,
26382638
Check that :issue:`38832` is fixed::
26392639
26402640
sage: B = BipartiteGraph(matrix([[1, 1], [1, 1]]))
2641-
sage: C = B.canonical_label()
2642-
sage: C.left, C.right
2643-
({0, 1}, {2, 3})
2644-
sage: C, certificate = B.canonical_label(certificate=True)
2645-
sage: C.left, C.right
2646-
({0, 1}, {2, 3})
2647-
sage: C = B.canonical_label(edge_labels=True)
2648-
sage: C.left, C.right
2649-
({0, 1}, {2, 3})
2641+
sage: B.canonical_label()
2642+
Bipartite graph on 4 vertices
2643+
sage: B.canonical_label(certificate=True)[0]
2644+
Bipartite graph on 4 vertices
2645+
sage: B.canonical_label(edge_labels=True)
2646+
Bipartite graph on 4 vertices
26502647
sage: B.allow_multiple_edges(True)
26512648
sage: B.add_edges(B.edges())
2652-
sage: C = B.canonical_label()
2653-
sage: C.left, C.right
2654-
({0, 1}, {2, 3})
2649+
sage: B.canonical_label()
2650+
Bipartite multi-graph on 4 vertices
26552651
26562652
.. SEEALSO::
26572653

0 commit comments

Comments
 (0)