jbs@kiss.inria.fr (Jean-Bernard Saint) (06/04/90)
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
mmh@cs.qmw.ac.uk (Matthew Huntbach) (06/05/90)
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