[racket] minimum spanning tree

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?

Thanks,
-Joe
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.racket-lang.org/users/archive/attachments/20121202/aedba016/attachment.html>