From ca0f5cc9979691ac78a36dac3c037e0fca822f1e Mon Sep 17 00:00:00 2001 From: janmenjayap Date: Sun, 10 Nov 2024 19:20:14 +0530 Subject: [PATCH] updated the doctest of remove_loops() --- src/sage/graphs/matching_covered_graph.py | 24 ----------------------- 1 file changed, 24 deletions(-) diff --git a/src/sage/graphs/matching_covered_graph.py b/src/sage/graphs/matching_covered_graph.py index 03cb4915d4f..6d4bb1ff439 100644 --- 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')]