Hi

How can i call the function for this code using Lisp ACL?

and explain plz

(defun a-star (start goal graph) (let ((open-list (list start)) (closed-list nil) (g-scores (list (cons start 0))) (f-scores (list (cons start (heuristic start goal))))) (loop while open-list do (let* ((current (pop open-list)) (g-score (getf g-scores current)) (neighbors (get-neighbors current graph))) (if (equal current goal) (return (reconstruct-path current closed-list)) (progn (push current closed-list) (loop for neighbor in neighbors do (let ((g (+ g-score (cost current neighbor))) (h (heuristic neighbor goal))) (when (or (not (member neighbor closed-list)) (< g (getf g-scores neighbor))) (setf (getf g-scores neighbor) g) (setf (getf f-scores neighbor) (+ g h)) (when (not (member neighbor open-list)) (push neighbor open-list) (sort open-list (lambda (a b) (< (getf f-scores a) (getf f-scores b))))))))))))))

Thx