| Name | Description |
|---|---|
| AStar | Class for performing A* pathfinding |
| AStarNode | Base class for path finding nodes, it holds no actual information about the map. An inherited class must be constructed from this class and all virtual methods must be implemented. Note, that calling base() in the overridden methods is not needed. |
| AStarNode2D | A node class for doing path finding on a 2-dimensional map Christy Lock Note: Astar.cs, Heap.cs and Main.cs were originally written by Sune Trundslev 4 Jan 2004 I has made small modifications to Astar.cs and Main.cs to handle the 3d Metaverse Specifically to return waypoints in generic string Lists broken into slope changes. These are returned to BotMe.cs. You can find the original code at http://www.codeproject.com/KB/recipes/csharppathfind.aspx Note that there is no specific license in the code download and the author states " With this class, you should be able to implement your own A* path finding to your own c# projects." |
| Heap | The Heap allows to maintain a list sorted as long as needed. If no IComparer interface has been provided at construction, then the list expects the Objects to implement IComparer. If the list is not sorted it behaves like an ordinary list. When sorted, the list's "Add" method will put new objects at the right place. As well the "Contains" and "IndexOf" methods will perform a binary search. |
| Heap.Comparison | |
| MainClass | Test class for doing A* path finding on a 2D map. |
| StartPath |