Hello,<br><br><div class="gmail_quote">2010/12/13 Eray Ozkural <span dir="ltr">&lt;<a href="mailto:examachine@gmail.com">examachine@gmail.com</a>&gt;</span><br><blockquote class="gmail_quote" style="margin: 0pt 0pt 0pt 0.8ex; border-left: 1px solid rgb(204, 204, 204); padding-left: 1ex;">
<div>Oww, is the imperative implementation using hash tables or maps then? </div></blockquote><div><br>Imperative implementations use hash tables (except the ones called Matrix which use arrays of bitvectors) while persistent implementations use maps.<br>
 </div><blockquote class="gmail_quote" style="margin: 0pt 0pt 0pt 0.8ex; border-left: 1px solid rgb(204, 204, 204); padding-left: 1ex;"><div>Shouldn&#39;t be too hard to plug your own in ocamlgraph if needed.</div></blockquote>
<div><br>OcamlGraph is designed for such an use : each algorithm provided by the library is a functor parameterized by the required graph operations (iterators over vertices and edges, ...). Thus you can provide your own in an easy way.<br>
<br>Hope this helps,<br>Julien Signoles<br></div></div><br>