From: Alain Boisvert
Subject: Dijkstra Algorithm
Date: Wed, 25 Feb 1998 00:00:00 +0000
Message-ID: <6d1i7c$h8c$1@titan.globalserve.net>

Hi everyone,
                        I am looking for Dijkstra's Shortest Path Algortithm
writen in LISP.  I found many versions in several languages but mot in LISP.

I am looking for 2 different versions of it.  The first one will consider
the weight of all arcs between nodes and the second consider only the
minimum number of nodes.

If someone can help me to find those algo, It will very appreciated.

Thanks for your time.

Alain Boisvert
·····@globalserve.net  (Home)
······@uqah.uquebec.ca  (University)
ICQ #  7929674