Path: utzoo!attcan!uunet!mcsun!ukc!icdoc!qmw-cs!mmh
From: mmh@cs.qmw.ac.uk (Matthew Huntbach)
Newsgroups: comp.lang.prolog
Subject: Re: Graphs in Prolog
Keywords: graphs, MVDS, arrays
Message-ID: <2329@sequent.cs.qmw.ac.uk>
Date: 5 Jun 90 12:45:35 GMT
References: <7944@mirsa.inria.fr>
Reply-To: mmh@cs.qmw.ac.uk (Matthew Huntbach)
Organization: Computer Science Dept, QMW, University of London, UK.
Lines: 15
Summary:
Expires:
Sender:
Followup-To:
Distribution:

In article <7944@mirsa.inria.fr> jbs@kiss.inria.fr (Jean-Bernard Saint) writes:
>Does anyone know of any experiment of implementing algorithms
>on graphs in Prolog?

Don't know about Prolog, but I am researching into graph
algorithms in Parlog at this very moment. See my paper in the
September 1989 issue of SIGPLAN notices.

Matthew Huntbach
Dept. of Computer Science
Queen Mary and Westfield College
University of London
Mile End Road
London, UK
E1 4NS