I'm interested in graph algorithms. To build on what Ted says, I think the best thing you could do is put up a patch that contains some code we can look at and then we can iterate.
On May 31, 2010, at 4:48 PM, Neal Clark wrote: > Hi, > > As part of my research for my masters thesis I have developed a number > of distributed MapReudce graph algorithms. If you are interested I > have both connectivity and minimum spanning tree algorithms which I > would be willing to contribute. Using the techniques developed for > these algorithms it would be easy to implement a large variety of > other graph algorithms. Please let me know if you are interested. > > Thanks, > > Neal.
