I think it would be good to have a self-contained function that confirms
that breadth_first_search leaks.
It seems to me that the following does NOT leak.
def check_bad4(n):
from sage.graphs.digraph_generators import DiGraphGenerators
from sage.combinat.posets.hasse_diagram import HasseDiagram
for dig in DiGraphGenerators()(n, is_poset):
P = HasseDiagram(dig)
for i in range(n):
x = P.breadth_first_search(i)
print get_memory_usage()
Martin
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-devel+unsubscr...@googlegroups.com.
To post to this group, send email to sage-devel@googlegroups.com.
Visit this group at https://groups.google.com/group/sage-devel.
For more options, visit https://groups.google.com/d/optout.
