-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Greetings ocaml hackers! In order to be granted the status of discriminating hacker, I'm posting the code for a dynamic array module and a directed graph module. I have seen such structures for ocaml requested on the list and elsewhere. While doing a project I needed the code that would give me the exact running time bounds so I should thank our computational geometry instructor :) Although I'm not providing for a general library interface including such things as walks, iterators, etc. in detail these should be sufficient to start writing algorithms with. I tried to make it look like an ordinary library module. The code is, naturally, an incomplete preliminary version and not tested widely at all, so be wary. Without further ado, I've attached the small files. This is almost my first piece of ocaml programming and therefore it is likely to contain gross style errors or annoyances. In particular, I've used ocaml lists for storing individual adjacencies of vertices. I thought this should work due to value sharing as employed by the functional structure but I'm aware I might be wrong and this probably calls for a benchmark to see if standard algorithms such as topological sort does work within the bounds. Comments welcome, - -- Eray Ozkural (exa) 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 -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.2.1 (GNU/Linux) iD8DBQE+oEqTfAeuFodNU5wRAsvwAJ9t/dZJL/qwB2Kj9Bso//qvnqdp+QCgo/Me ilUOF3By9YFtOR4gOAB7IN4= =nD3R -----END PGP SIGNATURE-----