Hi Rodion, BFS is already implemented in commons-graph[1] you can provide a GraphVisitHandler[2] implementation to handle the case when you have found the target node, so the search is now complete.
HTH, -Best [1] http://svn.apache.org/repos/asf/commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/visit/VisitTestCase.java [2] http://svn.apache.org/repos/asf/commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/visit/GraphVisitHandler.java http://people.apache.org/~simonetripodi/ http://twitter.com/simonetripodi On Fri, Sep 20, 2013 at 12:37 PM, Rodion Efremov <rodio...@cs.helsinki.fi>wrote: > Hello, might it be funky to have a few esoteric BFS-algorithms from [1]? > :^) > > -- > TIA, Rodion > > [1] > https://github.com/coderodde/**bfsbuddy<https://github.com/coderodde/bfsbuddy> > > ------------------------------**------------------------------**--------- > To unsubscribe, e-mail: > dev-unsubscribe@commons.**apache.org<dev-unsubscr...@commons.apache.org> > For additional commands, e-mail: dev-h...@commons.apache.org > >
