title: Total cost of the shortest path (A* algorithm)
body: <p>What does the "Total cost of the shortest pathway" mean when we use A* algorithm to find the shortest pathway between two nodes. Is it the total of final cost (G + H) of all the nodes in the pathway or total of heuristic costs of all the nodes in the pathway or total of movement cost of each and every node in the pathway? It would be grateful if someone can help me to get a clear understanding because I have an upcoming test on Algorithm and data structures. </p>