Hello,
On 01/02/2012 17:39, Simone Tripodi wrote:
Hi Gary!!! :)
I don't see any issue on adding the BST algorithms you need in
[graph], even if you have to reuse the minimum amount of codebase,
packages don't usually interact each other very much, unless some
DFS/BFS or shortest path is needed
I completely agree with Simone. I see [graph] as the right place not
only for well-known algorithms but also for state-of-the-art results,
where graphs are either support structures for computation or actual
main data structures fitting the user domain.
P.S.: with this I am not saying that
Hi Gary!!! :)
I don't see any issue on adding the BST algorithms you need in
[graph], even if you have to reuse the minimum amount of codebase,
packages don't usually interact each other very much, unless some
DFS/BFS or shortest path is needed in other algo.
I have the plan of adding KDTree
