commons-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Simone Tripodi <>
Subject Re: [graph] BST?
Date Wed, 01 Feb 2012 16:39:54 GMT
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 searches as well.

My personal vision of [graph] is realizing a graph-pedia of
graph-related algorithms implementation, so every addition is more
than welcome!!!

The only kind request I have, if you could have a look at how we are
trying to implement fluent APIs, and applying as well to BST.

Looking forward to see your commits, thanks in advance and welcome in
the brotherhood!!

On Wed, Feb 1, 2012 at 5:20 PM, Gary Gregory <> wrote:
> Hi All.
> I've been looking for a place to experiment with BST code and [graph] seems
> like a logical place since a BST is a directed graph.
> The issue I have is that I would like a o.a.c.graph.bst package but I do
> not see re-using much of the [graph] infra aside from some very basic
> interfaces.
> I do not want a [bst] project because eventually it should be possible to
> morph a 'classic/light' BST into a 'heavy' [graph].
> Thoughts?
> --
> E-Mail: |
> JUnit in Action, 2nd Ed: <http://goog_1249600977>
> Spring Batch in Action: <>
> Blog:
> Home:
> Tweet!

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

View raw message