本文整理汇总了C++中NodeType::Index方法的典型用法代码示例。如果您正苦于以下问题：C++ NodeType::Index方法的具体用法？C++ NodeType::Index怎么用？C++ NodeType::Index使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类NodeType的用法示例。
在下文中一共展示了NodeType::Index方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: GetClosestNodeToPosition
//------------------------ GetClosestNodeToPosition ---------------------------
//
// returns the index of the closest visible graph node to the given position
//-----------------------------------------------------------------------------
int Raven_PathPlanner::GetClosestNodeToPosition(Vector2D pos)const
{
double ClosestSoFar = MaxDouble;
int ClosestNode = no_closest_node_found;
//when the cell space is queried this the the range searched for neighboring
//graph nodes. This value is inversely proportional to the density of a
//navigation graph (less dense = bigger values)
const double range = m_pOwner->GetWorld()->GetMap()->GetCellSpaceNeighborhoodRange();
//calculate the graph nodes that are neighboring this position
m_pOwner->GetWorld()->GetMap()->GetCellSpace()->CalculateNeighbors(pos, range);
//iterate through the neighbors and sum up all the position vectors
for (NodeType* pN = m_pOwner->GetWorld()->GetMap()->GetCellSpace()->begin();
!m_pOwner->GetWorld()->GetMap()->GetCellSpace()->end();
pN = m_pOwner->GetWorld()->GetMap()->GetCellSpace()->next())
{
//if the path between this node and pos is unobstructed calculate the
//distance
if (m_pOwner->canWalkBetween(pos, pN->Pos()))
{
double dist = Vec2DDistanceSq(pos, pN->Pos());
//keep a record of the closest so far
if (dist < ClosestSoFar)
{
ClosestSoFar = dist;
ClosestNode = pN->Index();
}
}
}
return ClosestNode;
}