A-star search algorithm

I downloaded one MATLAB code from Github regarding A* search algorithm which I attached as a ZIP file. While running the code it takes input as a text file. There are two text file named "connections" and "locations" accordingly. Inside of those files are look like the Image given below. The main .m file "createGraph" take those text file as a input while running and shows the stright line distance or fewest links distance according to user selections. My problem is that, I do not understand those two text files meaning. What does it mean by A1 2 B1 A2A2..... in connections file as well as locations file. Please someone help me to understand those things.

Answer 1

[Eswara Venkata Kumar Dhulipala]

In locations.txt, for example, next to A1 are its x and y coordinates. In connections.txt, for example, next to A1 is the number of nodes connected to A1 followed by the list of nodes connected to A1.