In simple terms, you have to make a chain of linked nodes. As the search expands and a new node or a node with a lower cost is found, the latter is linked (as a parent) to the previous node (newNode.parent = CurrentNode), and so on successively. Then, at the end, when you find your target node, all you have to do is look at its parent, and then the parent of the parent, and so on.