"J. Radcliffe" wrote:
> 
> I have been giving some thought to writing modules that define some common
> algorithms. If there is some consistent methodology, they could be
> reused effectively in a number of ways. Various trees (b-trees,
> red-black-trees) and graphs come to my mind right away, but there are
> probably more. I've talked with matju about using these in his ArrayMixin,
> which would allow someone to, say, use a btree data structure with an
> array interface.
> 
> Any thoughts as to how this could be done most effectively?

Dunno, but I have Ruby implementations of algorithms for
single-source-shortest-path and maximum-weight-bipartite-matching graph
problems that I can contribute. I am sure they will need to be modified
a lot, YMMV.

Jon
-- 
_______________________________________________________________________
  Jonathan Aseltine     aseltine / cs.umass.edu     MAS, Umass, Amherst