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] Ocaml Graph manipulation algorithms & library
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2003-09-03 (10:44)
From: Eray Ozkural <exa@k...>
Subject: Re: [Caml-list] Ocaml Graph manipulation algorithms & library
Or you can do away with the lame C++ language and use ocaml. Please look at 
the list archives for the example of an imperative graph module I posted.

You could also implement a functional "map" but I don't think you would be 
happy writing an algorithm like subgraph isomorphism with such a thing... 
Look at the caml humps there is such a functional graph impl. there.

As for drawing, you'll prolly have to stick with one of the free graph drawing 


Eray Ozkural (exa) <>
Comp. Sci. Dept., Bilkent University, Ankara  KDE Project:
www:  Malfunction:
GPG public key fingerprint: 360C 852F 88B0 A745 F31B  EA0F 7C07 AE16 874D 539C

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