//-------------------------------------------------------------------------------------------------------- // PathPlanNode //-------------------------------------------------------------------------------------------------------- PathPlanNode::PathPlanNode(PathingNode* pNode, PathPlanNode* pPrevNode, PathingNode* pGoalNode) { GCC_ASSERT(pNode); m_pPathingNode = pNode; m_pPrev = pPrevNode; // NULL is a valid value, though it should only be NULL for the start node m_pGoalNode = pGoalNode; m_closed = false; UpdateHeuristics(); }
//==================================================== // PathPlanNode definitions //==================================================== PathPlanNode::PathPlanNode(PathingNode* pNode, PathPlanNode* pPrevNode, PathingNode* pGoalNode) { CB_ASSERT(pNode); m_pPathingNode = pNode; m_pPrev = pPrevNode; m_pGoalNode = pGoalNode; m_Closed = false; UpdateHeuristics(); }
void PathPlanNode::UpdatePrevNode(PathPlanNode* pPrev) { GCC_ASSERT(pPrev); m_pPrev = pPrev; UpdateHeuristics(); }