HI there

I've been using heavily annotated graphs for unfolding searches in 
artificial intelligence. I need annotations in both nodes and edges, the 
type of edges being a sum of several informations among them costs.
So incremental building and a control structure for traversal (queues, 
stacks, priority stacks) is a must. Lazy expansion of graphs would also 
be a boon, but I guess this can be coded into the functional recursion 
traversal.

Regards and thank you very much for asking. Please count me as one 
looking eagerly forwards to seeing your code working,

    F. Valverde

Jean-Christophe Filliatre wrote:

>Dear ocaml users,
>
>Sylvain  Conchon, Julien  Signoles  and myself  have  started a  graph
>library for ocaml. Before going further and releasing this library, we
>would like to get some  feedback from people currently using graphs in
>ocaml applications or willing to  do so. More precisely, we would like
>to  know what  kind of  operations on  the graph  structure  and graph
>algorithms are commonly used by such users.
>
>Could you please tell us if you  are the author of a graph library not
>already mentioned in the ocaml hump?
>
>Please answer privately.
>
>  
>

-------------------
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