salam
iam trying to implement a program wich make the A* search but i cant do that .the program is that if we have a map and we have a start point and end point and there is a wall between them(in a text pad file) then what is the minimum path i should take to reach the end point
example:
********************************
* * *
* * * S *
* * *
* ********* ************ * *** *
* * ***** *
* * *
* * * *
* * * *
* E * * * *
* * *
********************************
then how i can insert this file to my program and then find the minimum path between S and E using C++ language
thanks for your helping