A Star Algorithm, Graph Algorithms, Graph, Data Structure Algorithm, Algorithms.
the closed list, if the n is the target node, return success and exit. Expand node n. If any successor to n is the target node, return success and the shortest path by tracing the path from the target node to the start node. Else, for each successor node, a) Apply the evaluation function f to the