-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi!
Here's patch against HEAD version of DFS algorithm in
jakarta-commons-sandbox/graph2 package - it uses less memory, which is
important for very large graphs (as in my case). Additionally DFS now
can use lazy graph implementations without causing
Scooter,
I didn't see the patch in your email. Can you send
it again?
Also, it turns out there are no DFS tests in the
project. (It is still in the sandbox after all.)
If you provide one, you will have our undying
grattitude.
Thanks,
DDP
--- Tomasz Skutnik [EMAIL PROTECTED] wrote:
