本文整理汇总了C#中NavGraph.NumNodes方法的典型用法代码示例。如果您正苦于以下问题：C# NavGraph.NumNodes方法的具体用法？C# NavGraph.NumNodes怎么用？C# NavGraph.NumNodes使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类NavGraph的用法示例。
在下文中一共展示了NavGraph.NumNodes方法的3个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C#代码示例。
示例1: Graph_SearchDijkstra
public Graph_SearchDijkstra(NavGraph navGraph,
int sourceNodeID,
int targetNodeID = -1)
{
navGraph_ = navGraph;
shortestPathTree_ = new NavGraphEdge[navGraph.NumNodes()];
searchFrontier_ = new NavGraphEdge[navGraph.NumNodes()];
costToThisNode_ = new float[navGraph.NumNodes()];
sourceNodeID_ = sourceNodeID;
targetNodeID_ = targetNodeID;
Search();
}示例2: Graph_SearchAStar_TS
public Graph_SearchAStar_TS(NavGraph graph, int source, int target)
: base(SearchType.AStar)
{
graph_ = graph;
shortestPathTree_ = new NavGraphEdge[graph.NumNodes()];
searchFrontier_ = new NavGraphEdge[graph.NumNodes()];
gCosts_ = new float[graph.NumNodes()];
fCosts_ = new float[graph.NumNodes()];
sourceIdx_ = source;
targetIdx_ = target;
//create the PQ
pq_ = new IndexedPriorityQLow(fCosts_, graph_.NumNodes());
//put the source node on the queue
pq_.Insert(sourceIdx_);
}示例3: Graph_SearchDijkstras_TS
public Graph_SearchDijkstras_TS( NavGraph navGraph,
int sourceNodeIndex,
int targetNodeIndex)
: base(Graph_SearchTimeSliced.SearchType.Dijkstra)
{
navGraph_ = navGraph;
shortestPathTree_ = new NavGraphEdge[navGraph_.NumNodes()];
searchFrontier_ = new NavGraphEdge[navGraph_.NumNodes()];
costToThisNode_ = new float[navGraph_.NumNodes()];
sourceNodeIndex_ = sourceNodeIndex;
targetNodeIndex_ = targetNodeIndex;
//create the PQ ,
pq_ = new IndexedPriorityQLow( costToThisNode_, navGraph_.NumNodes() );
//put the source node on the queue
pq_.Insert( sourceNodeIndex_ );
}