I am possibly looking to develop an A* pathfinding algorithm for part of my project to navigate an entity around a 2D map. I have seen the algorithm implemented using a linked list. Although I have covered linked lists in my studies and would feel confident using them, I would prefer if possible to iterate over an array instead. Does anyone know if this can be done or are the 'next' and 'previous' pointer elements of a linked list going to be crucial in an algroithm such as this?