Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
[Caml-list] poll for a graph library
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Jacques Carette <carette@m...>
Subject: Re: [Caml-list] poll for a graph library
Jean-Christophe Filliatre <> wrote:
>   2. Several  algorithms  over graphs,  written  as  functors and  thus
>      independently of the graph  implementation 

Sounds very useful.  One item I would very much like to see: when one is merely interested in using some (efficient!) 
graph algorithm, there is often a choice of data structures to be made.  Figuring out the asymptotics of each 
algorithm over each data structure is feasible, but should be quite unnecessary: it would be quite convenient if there 
were information functions [as part of the functor modules] which would output the asymptotic behaviour of the 

This would be especially useful as some data structure-algorithm pairs are woefully inefficient, especially when it 
comes to graphs!  


To unsubscribe, mail Archives:
Bug reports: FAQ:
Beginner's list: