Dijkstra's algorithm: Difference between revisions
Content added Content deleted
| Line 1,392: | Line 1,392: | ||
(car (sort *r* #'< :key #'cadr))) |
(car (sort *r* #'< :key #'cadr))) |
||
(defun paths (w c g |
(defun paths (w c g z v) |
||
(if (eql c g) (push `(,(reverse v) ,z) *r*) |
(if (eql c g) (push `(,(reverse v) ,z) *r*) |
||
(loop for a in (nodes c w) do |
(loop for a in (nodes c w) do |
||