Re: [graph & collections] Fibonacci Heap implementation
Of course Matt, I would be much more than pleased to co-work with you!!! What I need is just the new laptop arrives, ATM I'm using a temporary computer where I cannot install my toys due to resources limitations. I'm pretty sure in 2 more working days I'm in the conditions to give a help! Many thanks, all the best!!! Simo http://people.apache.org/~simonetripodi/ http://www.99soft.org/ On Tue, Jul 19, 2011 at 2:58 PM, Matt Benson wrote: > On Tue, Jul 19, 2011 at 3:05 AM, Simone Tripodi > wrote: >> Hi Stephen >> it looks like indeed that [collections] development is in stand-by :( >> Give me a voice if you need any help to release it, I'd would be more >> than pleased to be helpful! >> If you're interested on contributing on [graph], keeping an eye on >> moving codebase to collections, you are welcome as well :) >> Have a nice day, all the best! >> Simo >> > > Simo, > With no slight to others intended, I had been one of the only > Commons devs still trying to put some time into [collections] to get > it to a 4.0 release, and arguing against its mothballing. I've got a > large commit to make in a few hours, then I'll try to make time to dig > through old emails to see what's outstanding. If you could spare some > of that inexhaustible energy of yours to get [collections] out the > door, I'd really appreciate it! > > Matt > >> http://people.apache.org/~simonetripodi/ >> http://www.99soft.org/ >> >> >> >> On Tue, Jul 19, 2011 at 12:53 AM, Stephen Colebourne >> wrote: >>> 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 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-unsubscr...@commons.apache.org For additional commands, e-mail: dev-h...@commons.apache.org >>> >>> - >>> To unsubscribe, e-mail: dev-unsubscr...@commons.apache.org >>> For additional commands, e-mail: dev-h...@commons.apache.org >>> >>> >> >> - >> To unsubscribe, e-mail: dev-unsubscr...@commons.apache.org >> For additional commands, e-mail: dev-h...@commons.apache.org >> >> > > - > To unsubscribe, e-mail: dev-unsubscr...@commons.apache.org > For additional commands, e-mail: dev-h...@commons.apache.org > > - To unsubscribe, e-mail: dev-unsubscr...@commons.apache.org For additional commands, e-mail: dev-h...@commons.apache.org
Re: [graph & collections] Fibonacci Heap implementation
On Tue, Jul 19, 2011 at 3:05 AM, Simone Tripodi wrote: > Hi Stephen > it looks like indeed that [collections] development is in stand-by :( > Give me a voice if you need any help to release it, I'd would be more > than pleased to be helpful! > If you're interested on contributing on [graph], keeping an eye on > moving codebase to collections, you are welcome as well :) > Have a nice day, all the best! > Simo > Simo, With no slight to others intended, I had been one of the only Commons devs still trying to put some time into [collections] to get it to a 4.0 release, and arguing against its mothballing. I've got a large commit to make in a few hours, then I'll try to make time to dig through old emails to see what's outstanding. If you could spare some of that inexhaustible energy of yours to get [collections] out the door, I'd really appreciate it! Matt > http://people.apache.org/~simonetripodi/ > http://www.99soft.org/ > > > > On Tue, Jul 19, 2011 at 12:53 AM, Stephen Colebourne > wrote: >> 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 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-unsubscr...@commons.apache.org >>> For additional commands, e-mail: dev-h...@commons.apache.org >>> >>> >> >> - >> To unsubscribe, e-mail: dev-unsubscr...@commons.apache.org >> For additional commands, e-mail: dev-h...@commons.apache.org >> >> > > - > To unsubscribe, e-mail: dev-unsubscr...@commons.apache.org > For additional commands, e-mail: dev-h...@commons.apache.org > > - To unsubscribe, e-mail: dev-unsubscr...@commons.apache.org For additional commands, e-mail: dev-h...@commons.apache.org
Re: [graph & collections] Fibonacci Heap implementation
Hi Stephen it looks like indeed that [collections] development is in stand-by :( Give me a voice if you need any help to release it, I'd would be more than pleased to be helpful! If you're interested on contributing on [graph], keeping an eye on moving codebase to collections, you are welcome as well :) Have a nice day, all the best! Simo http://people.apache.org/~simonetripodi/ http://www.99soft.org/ On Tue, Jul 19, 2011 at 12:53 AM, Stephen Colebourne wrote: > 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 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-unsubscr...@commons.apache.org >> For additional commands, e-mail: dev-h...@commons.apache.org >> >> > > - > To unsubscribe, e-mail: dev-unsubscr...@commons.apache.org > For additional commands, e-mail: dev-h...@commons.apache.org > > - To unsubscribe, e-mail: dev-unsubscr...@commons.apache.org For additional commands, e-mail: dev-h...@commons.apache.org
Re: [graph & collections] Fibonacci Heap implementation
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 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-unsubscr...@commons.apache.org > For additional commands, e-mail: dev-h...@commons.apache.org > > - To unsubscribe, e-mail: dev-unsubscr...@commons.apache.org For additional commands, e-mail: dev-h...@commons.apache.org
[graph & collections] Fibonacci Heap implementation
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-unsubscr...@commons.apache.org For additional commands, e-mail: dev-h...@commons.apache.org
