updated the doctest of remove_loops()

sagemath · Nov 10, 2024 · ca0f5cc · ca0f5cc
1 parent a2b4a9d
commit ca0f5cc
Showing 1 changed file with 0 additions and 24 deletions.
diff --git a/src/sage/graphs/matching_covered_graph.py b/src/sage/graphs/matching_covered_graph.py
@@ -2352,22 +2352,10 @@ def remove_loops(self, vertices=None):
             sage: G = MatchingCoveredGraph(W)
             sage: G
             Matching covered wheel graph: graph on 6 vertices
-            sage: G.has_loops()
-            False
-            sage: G.allows_loops()
-            False
             sage: G.add_edge(0, 0)
             Traceback (most recent call last):
             ...
             ValueError: loops are not allowed in matching covered graphs
-            sage: G.loops()
-            []
-            sage: G.loop_edges()
-            []
-            sage: G.loop_vertices()
-            []
-            sage: G.number_of_loops()
-            0
             sage: G.remove_loops()
             sage: G.edges(sort=True)
             [(0, 1, None), (0, 2, None), (0, 3, None), (0, 4, None),
@@ -2389,18 +2377,6 @@ def remove_loops(self, vertices=None):
             ValueError: loops are not allowed in matching covered graphs
             sage: G.edges(sort=False)
             [(0, 1, None), (0, 1, 'label')]
-            sage: G.allows_loops()
-            False
-            sage: G.has_loops()
-            False
-            sage: G.loops()
-            []
-            sage: G.loop_edges()
-            []
-            sage: G.loop_vertices()
-            []
-            sage: G.number_of_loops()
-            0
             sage: G.remove_loops(vertices=[0, 1])
             sage: G.edges(sort=False)
             [(0, 1, None), (0, 1, 'label')]