Hi,

I really like SearchForest and have been using it some times. But, other 
times, my children rules are such that two disctinct branches overlap. So, 
just last weekend, I coded a similar SearchGraph class taking as input a 
set of roots and a children rule where an element can  be obtained in a non 
unique path. The difference with SearchForest is that it returns an 
iterator over all distinct elements (it remembers if an element as been 
reached already).

So if SearchForest get renamed to RecursiveSet, what name should be given 
to SearchGraph? It sounds like RecursiveSet could be a good name as well 
for SearchGraph...

Also, if SearchForest was giving me the intuition about the unique way to 
get to a node of the forest, RecursiveSet doesn't not. Is this a problem?

Sébastien

-- 
You received this message because you are subscribed to the Google Groups 
"sage-devel" group.
To post to this group, send email to sage-devel@googlegroups.com.
To unsubscribe from this group, send email to 
sage-devel+unsubscr...@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-devel?hl=en.


Reply via email to