On Sun, Dec 2, 2012 at 10:05 PM, Joe Gilray <jgil...@gmail.com> wrote: > I searched the mailing list archives and didn't find any references to an > implementation of a minimum spanning tree algorithm. I've implemented > Prim's algorithm years ago in C#, but I was surprised not to find anything > on Planet or the archive. > > If I create an implementation, where should I "publish" it? In Planet or > github? What would be the preferred format for the weighted graph?
If you put it on github, it is trivial to turn it into a Racket package: http://pre.racket-lang.org/docs/html/planet2/Developing_Packages.html But it requires the pre-release version. > > Thanks, > -Joe > > ____________________ > Racket Users list: > http://lists.racket-lang.org/users > -- Jay McCarthy <j...@cs.byu.edu> Assistant Professor / Brigham Young University http://faculty.cs.byu.edu/~jay "The glory of God is Intelligence" - D&C 93 ____________________ Racket Users list: http://lists.racket-lang.org/users
