Lisp Programming - Find Acyclic Path

Given a graph G and two nodes A and Z in G, write a program that finds an acyclic path P between A and Z. The path should be represented as an ordered list of nodes from the start node to the goal node. Since the path must be acyclic, a node can appear in the path only once.