commons-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Simone Tripodi <>
Subject Re: [graph] Doubts on DFS algorithm implementation
Date Sun, 26 Feb 2012 21:03:12 GMT

> It's a good idea, Now we have implemented two separate methods that visit the graph for
dfs and bfs. We should do a little refactoring and implement a unique method that switches
between dfs and bfs simply changing the the type of visitedVertex. WDYT?

it would be nice indeed, but which level of collection APIs
abstraction you suggest to represent both a stack and a queue, to be
passed to the visiting algorithm?

If you already haas an idea, please fill an issue and work on it!


To unsubscribe, e-mail:
For additional commands, e-mail:

View raw message