Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!csd4.milw.wisc.edu!bionet!ig!ames!pacbell!att!ihlpl!canoura
From: canoura@ihlpl.ATT.COM (jlcanoura)
Newsgroups: comp.lang.lisp
Subject: Dijkstras shortest path algorithm
Keywords: help
Message-ID: <10390@ihlpl.ATT.COM>
Date: 3 May 89 22:38:41 GMT
Organization: AT&T Bell Laboratories - Naperville, Illinois
Lines: 8

Please does any body know how to implement Dijkstras
shortest path alg. in LISP to find the shortest path
from a source vertex, to all other vertices in a directed
connected graph.


                                  thanks in advance
                                  ihlpl!canoura