Path: utzoo!utgpu!news-server.csri.toronto.edu!mailrus!cs.utexas.edu!usc!snorkelwacker!bloom-beacon!eru!luth!sunic!mcsun!inria!mirsa!kiss.inria.fr!jbs
From: jbs@kiss.inria.fr (Jean-Bernard Saint)
Newsgroups: comp.lang.prolog
Subject: Graphs in Prolog
Keywords: graphs, MVDS, arrays
Message-ID: <7944@mirsa.inria.fr>
Date: 4 Jun 90 08:39:42 GMT
Sender: news@mirsa.inria.fr
Reply-To: jbs@kiss.inria.fr (Jean-Bernard Saint)
Organization: INRIA Sophia Antipolis
Lines: 14

Does anyone know of any experiment of implementing algorithms
on graphs in Prolog? This includes graph representation,
detection of cycle, computation of strongly connected components,
graph modification, ...
As the logical variable does not allow for efficient handling of
classical data structures, this would probably involve the
multiple version data structures of Barklund & Millroth
implemented in Tricia, or something of the kind.
Is there any knowledge on this topic, and on relative
performances wrt C implementation for instance ?

				Thanks

					Jean-Bernard Saint