commons-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Stephen Colebourne <scolebou...@joda.org>
Subject Re: [graph & collections] Fibonacci Heap implementation
Date Mon, 18 Jul 2011 22:53:47 GMT
I think from the quiet reply its apparent that [collections] is pretty
quiet these days. I think [collections] development must focus first
on a release of a Java 5 version of what it has, rather than new code.
Stephen

On 14 July 2011 01:19, Simone Tripodi <simonetripodi@apache.org> wrote:
> Hi all guys,
> in order to improve graph algorithms performances, I started
> implementing in [graph] an advanced priority queue called Fibonacci
> Heap[1], based on detailed description of University of Science and
> Technology of China's lessons[2].
> You can find initial implementation on 'collections'[3] package in
> [graph] (sandbox) - it is still a little bugged, indeed A* and
> Dijkstra implementations are working with it while Prim & Kruskal, not
> - but I think that it could be added in [collections] once completed
> (I'm trying to implement it as java.util.Queue).
> Is there anyone from [collections] interested on that topic that wants
> to join efforts?
> TIA, all the best!!!
> Simo
>
> [1] http://en.wikipedia.org/wiki/Fibonacci_heap
> [2] http://staff.ustc.edu.cn/~csli/graduate/algorithms/book6/chap21.htm
> [3] https://svn.apache.org/repos/asf/commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/collections
>
> http://people.apache.org/~simonetripodi/
> http://www.99soft.org/
>
> ---------------------------------------------------------------------
> To unsubscribe, e-mail: dev-unsubscribe@commons.apache.org
> For additional commands, e-mail: dev-help@commons.apache.org
>
>

---------------------------------------------------------------------
To unsubscribe, e-mail: dev-unsubscribe@commons.apache.org
For additional commands, e-mail: dev-help@commons.apache.org


Mime
View raw message