67d62e0664eb21442510b8c7922e856345164fcb
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. git-svn-id: https://svn.apache.org/repos/asf/jakarta/commons/sandbox/graph2/trunk@144643 13f79535-47bb-0310-9956-ffa450edef68
Languages
Java
100%