Skip to content
This repository has been archived by the owner on Jan 30, 2023. It is now read-only.

Commit

Permalink
Removed the doctest with findstat as it seems currently incompatible …
Browse files Browse the repository at this point in the history
…with py3.

(maybe #27346 fixes it)
  • Loading branch information
Jean-Florent Raymond committed Apr 10, 2019
1 parent 4353445 commit 6d07f4c
Showing 1 changed file with 0 additions and 5 deletions.
5 changes: 0 additions & 5 deletions src/sage/graphs/domination.py
Original file line number Diff line number Diff line change
Expand Up @@ -327,11 +327,6 @@ def minimal_dominating_sets(G, to_dominate=None):
sage: big_check(6) # long time
True
::
sage: findstat([(G, sum(1 for _ in minimal_dominating_sets(G))) for n in range(6) for G in graphs(n)], depth=0) # optional - internet
0: (St001302: The number of minimally dominating sets of vertices of a graph., [], 52)
.. WARNING:
We assume that vertices are sortable (i.e. they can be compared).
Expand Down

0 comments on commit 6d07f4c

Please sign in to comment.