This is a simple A* (A-Star)
implementation. I did this for one
of my university projects, so don‘
t expect it would be very good.
Anyway, it‘s very simple because I
‘m not a C# programmer.
ere are four classes, first one
(class1.cs) is just a test for path
finding, it opens a file and fills
an array and uses it to
The second class, Path(path.cs) is
used by third class to find the
The third class Node, is used by
The fourth class,
PathFinding(pathfinding.cs) has a
function, FindPath(), you can use
it to get shortest path, its inputs
starti: column of start point in
startj: row of start point in the
nexti: column of destination point
in the array
nextj: row of destination point in
map: this is our array that has the
BTW, excuse me for my poor English.