Please help me implement the path search algorithm A *. I am new to programming and I don't know much about it.
I read the article Algorithm A * for beginners (well, it is most understandable) + found some source code in Java.
Intuitive algorithm is clear. On each crock for each point from the open list, we consider the value F = G + H (how to calculate them, I understand), etc.
It is not clear how to do all this programmatically at the "beginner" level.
For example, I don’t understand how to work with lists, how to check points and how to determine the parent point for the current point.
Probably, we need some class of type DOT with properties x, y, F, G, H, a parent that can count the values of F, G, H and save the parent. But if so, then immediately create objects for each point of the map or how.
As lists I thought to use <vector>.
Examples of sources that I found on the web are obscure.