Anonymous user
Dijkstra's algorithm: Difference between revisions
→{{header|Common Lisp}}
Line 1,363:
(defun paths (c g z v)
(if (eql c g) (push `(,(reverse v) ,z) *r*)
(loop for a in (nodes c) for b = (cadr a) do
(unless (member
(paths
(defun nodes (c)
Line 1,395 ⟶ 1,394:
(defun paths (w c g z v)
(if (eql c g) (push `(,(reverse v) ,z) *r*)
(loop for a in (nodes c w) for b = (cadr a) do
(unless (member
(paths w
(defun nodes (c w)
| |||