Dijkstra's algorithm: Difference between revisions

Line 1,380:
(defun dijkstra-short-paths (z w)
(loop for (a b) in (pairs z) do
(letformat ((et (short-path"~{Path: w~A a b)))Distance: ~A~}~%"
(format t "Path: ~A Distance: ~A(short-path w a ~%"b))))
(car e) (cadr e)))))
(defun pairs (w)
Anonymous user