Hey, somebody yell if you've been able to use the digraph and dynarray code I 
posted earlier! I'd also love to have wishlists!!!

Some other things I forgot to mention: An undirected graph adaptor is easy. I 
initially started with a vertex/edge weighted graph... Also I plan to 
functor-ize the graph modules making it more generic, ultimately the 
representation should be abstracted away completely. Then you have classes, 
oops, modules that have different time/space complexities for storage and 
update, query operations....

BTW, does somebody have a good idea of how to make one module inherit from 
another? Say, for implementing Graph using Digraph. It's too bad there isn't 
an Ada like package extension mechanism.

Cheers,


-- 
Eray Ozkural (exa) <erayo@cs.bilkent.edu.tr>
Comp. Sci. Dept., Bilkent University, Ankara  KDE Project: http://www.kde.org
www: http://www.cs.bilkent.edu.tr/~erayo  Malfunction: http://mp3.com/ariza
GPG public key fingerprint: 360C 852F 88B0 A745 F31B  EA0F 7C07 AE16 874D 539C

-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners