Hi all,
I don’t mean to create a topic regarding the exact same subject as another topic on the front page, but I didn’t want to hijack their’s. 
Anyway, I’ve been implementing A* path finding from a tutorial found here: http://web.mit.edu/eranki/www/tutorials/search/
I’ve been going off the algorithm detailed at the bottom of that page and was just wondering where the final path is.
In other implementations of this algorithm, there was an open, closed and final path list. I understand most of the algorithm, but once it’s been designed, how do I access the final list of nodes?
Thanks 