当前位置: 首页>>代码示例>>C#>>正文


C# Heap.removeFirst方法代码示例

本文整理汇总了C#中Heap.removeFirst方法的典型用法代码示例。如果您正苦于以下问题:C# Heap.removeFirst方法的具体用法?C# Heap.removeFirst怎么用?C# Heap.removeFirst使用的例子?那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在Heap的用法示例。


在下文中一共展示了Heap.removeFirst方法的1个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的C#代码示例。

示例1: findPath

	public void findPath(Vector3 startPos, Vector3 targetPos) {

//		Vector3 [] waypoints = new Vector3[0];
//		bool pathSuccess = false;
		pathFindingFailed = false;
		Node startNode = grid.nodeFromWorld(startPos);
		Node targetNode = grid.nodeFromWorld(targetPos);
		//this can be changed, it's purpose is not to allow an infinite loop to occur in case of an impossible path, althought this shouldn't happen, it is present for emergency
		int limitedTrial = maxTrial; 
		if(startNode.walkable && targetNode.walkable){
			Heap<Node> openSet = new Heap<Node>(grid.MaxSize);
			HashSet<Node> closedSet = new HashSet<Node>();
			openSet.Add(startNode);

			while (openSet.Count > 0) {
				Node currentNode = openSet.removeFirst();

	//			for (int i = 1; i < openSet.Count; i ++) {
	//				if (openSet[i].fCost < currentNode.fCost || openSet[i].fCost == currentNode.fCost && openSet[i].hCost < currentNode.hCost) {
	//						currentNode = openSet[i];
	//				}
	//			}
	//			
	//			openSet.Remove(currentNode);
				closedSet.Add(currentNode);
				
				if (currentNode == targetNode) {
					//pathSuccess = true;
					RetracePath(startNode,targetNode);
					grid.worldFromNode(grid.path);
					break;
				}

				foreach (Node neighbour in grid.getNeighbours(currentNode)) {
					if (!neighbour.walkable || closedSet.Contains(neighbour)) {
						continue;
					}
					
					int newMovementCostToNeighbour = currentNode.gCost + GetDistance(currentNode, neighbour);
					if (newMovementCostToNeighbour < neighbour.gCost || !openSet.Contains(neighbour)) {
						neighbour.gCost = newMovementCostToNeighbour;
						neighbour.hCost = GetDistance(neighbour, targetNode);
						neighbour.parent = currentNode;
						
						if (!openSet.Contains(neighbour)){
							openSet.Add(neighbour);
						}
						else{
							openSet.UpdateItem(neighbour);
						}
					}
					if(limitedTrial <= 0){
						limitedTrial = maxTrial;

						grid.path = null;
						pathFindingFailed = true;
						return;
					}
					limitedTrial--;
				}
			}
		}
		else{
			grid.path = null;
		}
	}
开发者ID:marouen-lamiri,项目名称:Second-Soul,代码行数:66,代码来源:PathFinding.cs


注:本文中的Heap.removeFirst方法示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。