Hi!
I downloaded the most up to date version of kpat from anoncvs.kde.org and
noticed that the method used is Hard DFS. Since kpat halts and resumes the
solve a lot, I suggest Soft-DFS will be used instead, now that it has a
stable, hopefully memory-leak free code.
Hard DFS uses procedural recursion to perform a Depth-First Search scan.
Thus, it requires O(d) time to halt and resume. Soft-DFS on the other
hand, has its own dedicated stacks, and thus requires O(1) time. So, it
makes for a better option, and it is possible that it is even faster then
Hard-DFS, without being interrupted. From my impression it seemed roughly
the same speed, but I have yet to do a full benchmark.
Stephan, please take note.
Regards,
Shlomi Fish
----------------------------------------------------------------------
Shlomi Fish shlomif_at_vipe.technion.ac.il
Home Page:
http://t2.technion.ac.il/~shlomif/
Home E-mail: shlomif_at_techie.com
The prefix "God Said" has the extraordinary logical property of
converting any statement that follows it into a true one.
Received on Tue Feb 20 2001 - 05:51:37 IST