functional graph

[Eray Ozkural]

On Wednesday 16 July 2003 00:02, Hal Daume wrote:
> > But it looks the Graph class works on types a and b
> > where a is the Node type where b is the Edge type, or
> > just the other way around :), I don't have the code
> > right now.
>
> Yes, 'Graph n e' is a graph whose nodes are labelled with elements of
> type n and whose edges are labelled with elements of type e.

I posted an imperative graph module on this list. You could try that instead 
of functional graphs. I'm going to write a functional wrapper for that in the 
future.

Regards,

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