-----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 full, in-memory vertex retrieval on search initialization.
All existing tests passed.
I've modified only org.apache.commons.graph.algorithm.search version, didn't touch org.apache.commons.graph.search one - is it still used? Whever responsible, please apply.
Scooter
- --
Tomasz Skutnik, R&D Director, www.e-point.pl tel +48 (22) 853 48 30, mob +48 501 555 705, fax +48 (22) 853 48 30 e-point S.A., ul. Filona 16, 02-658 Warsaw, Poland PGP/GPG public key: http://scooter.ext.e-point.pl/tomasz.skutnik.gpg -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.2.2 (GNU/Linux) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org
iD8DBQE/Hmo6ZH/nE/TPGGQRAso8AJ9YNfI8gOEbiIKKyp/DxVW60wj7UQCeLmlb wwC3K22vkyCC+qOVYu9sj8A= =h+1P -----END PGP SIGNATURE-----
--------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
