AyStar::Path Class Reference

Detailed Description

The path of the AyStar algorithm. It is reversed, that is, the first entry is more close to the goal-nodes than his GetParent(). You can walk this list to find the whole path. The last entry has a GetParent() of null.

---

The documentation for this class was generated from the following file:

• main.nut