![]() |
VR-Forces 4.0.4 Class Documentation
|
| aStarValue() | DtAStarNode | [virtual] |
| deadEnd() | DtAStarNode | [virtual] |
| DtAStarNode(const DtPoint &point, double cost, DtPathPlanner *pathPlanner) | DtAStarNode | |
| expand(double valueLimit=1e255) | DtAStarNode | [virtual] |
| generateChildNodes()=0 | DtAStarNode | [pure virtual] |
| markVisited()=0 | DtAStarNode | [pure virtual] |
| myApproachVector | DtAStarNode | [protected] |
| myAStarValue | DtAStarNode | [protected] |
| myCost | DtAStarNode | [protected] |
| myDeadEnd | DtAStarNode | [protected] |
| myExpanded | DtAStarNode | [protected] |
| myNodeList | DtAStarNode | [protected] |
| myPathPlanner | DtAStarNode | [protected] |
| myPoint | DtAStarNode | [protected] |
| nearbyPreferredSegments(const DtPoint &point, std::list< const DtNetworkSegment * > &resultList) | DtAStarNode | [protected, virtual] |
| point() | DtAStarNode | [virtual] |
| postSolution() | DtAStarNode | [virtual] |
| removeDeadEnds() | DtAStarNode | [virtual] |
| setApproachVector(const DtPoint &approachVector) | DtAStarNode | [virtual] |
| sortNodes() | DtAStarNode | [virtual] |
| turningCost(const DtPoint &destination) | DtAStarNode | [virtual] |
| visited()=0 | DtAStarNode | [pure virtual] |
| ~DtAStarNode() | DtAStarNode | [virtual] |