From 5aeaccffe6193a42f7a06399198f043fb9ab8302 Mon Sep 17 00:00:00 2001 From: Nathann Cohen Date: Thu, 13 Mar 2014 18:03:19 +0100 Subject: [PATCH] trac #13917: A misnamed function --- src/sage/graphs/independent_sets.pyx | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/src/sage/graphs/independent_sets.pyx b/src/sage/graphs/independent_sets.pyx index c76caf270fb..6cd97ee311a 100644 --- a/src/sage/graphs/independent_sets.pyx +++ b/src/sage/graphs/independent_sets.pyx @@ -162,22 +162,22 @@ cdef class IndependentSets: sage: for i in range(30): ... check_matching(graphs.RandomGNP(11,.3)) - Compare the result with the output of subgraph_search:: + Compare the result with the output of :meth:`subgraph_search`:: sage: from sage.sets.set import Set - sage: def check_matching(G): + sage: def check_with_subgraph_search(G): ... IS = set(map(Set,list(IndependentSets(G)))) ... if not all(G.subgraph(l).is_independent_set() for l in IS): ... print "Gloops" - ... omega = max(map(len,IS)) + ... alpha = max(map(len,IS)) ... IS2 = [Set([x]) for x in range(G.order())] + [Set([])] - ... for n in range(2,omega+1): + ... for n in range(2,alpha+1): ... IS2.extend(map(Set,list(G.subgraph_search_iterator(Graph(n), induced = True)))) ... if len(IS) != len(set(IS2)): ... print "Oops" ... print len(IS), len(set(IS2)) sage: for i in range(5): - ... check_matching(graphs.RandomGNP(11,.3)) + ... check_with_subgraph_search(graphs.RandomGNP(11,.3)) Empty graph::