Version française
Home     About     Download     Resources     Contact us    
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: -- (:)
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 
tools.

Cheers,

-- 
Eray Ozkural (exa) <erayo@cs.bilkent.edu.tr>
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

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