文件列表:

A算法演示 (0, 2004-06-22)
A算法演示\Class1.cs (1929, 2003-05-22)
A算法演示\map.txt (208, 2003-05-22)
A算法演示\node.cs (212, 2003-08-09)
A算法演示\Path.cs (3612, 2003-08-09)
A算法演示\Path-UProject.csproj (4103, 2003-05-21)
A算法演示\Path-UProject.sln (922, 2003-05-20)
A算法演示\Path-UProject.suo (7168, 2003-08-09)
A算法演示\Path-UProject.csproj.user (1774, 2003-08-09)
A算法演示\App.ico (1078, 2003-05-20)
A算法演示\AssemblyInfo.cs (2426, 2003-05-20)

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. There 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 pathfinding. The second class, Path(path.cs) is used by third class to find the path. The third class Node, is used by Path class. The fourth class, PathFinding(pathfinding.cs) has a function, FindPath(), you can use it to get shortest path, its inputs are: starti: column of start point in the array startj: row of start point in the array nexti: column of destination point in the array nextj: row of destination point in the array map: this is our array that has the map BTW, excuse me for my poor English. Cheers, H.Ebrahimi

近期下载者：

相关文件：

评论：[我要评论] [举报此文件]

收藏者：