1C#广度优先算法

return Answer.Exist;//返回成功 if (nodes > MaxNodes) return Answer.NotExistInNodes; } return Answer.NotExist; } #endregion
#region 初始化startboard和endboard string பைடு நூலகம்odeString1 = ""; string codeString2 = ""; int sEmpty = 0; int dEmpty = 0; for (int i = 0; i < 3; i++) for (int j = 0; j < 3; j++) { if (sCode[i, j] != 0) { codeString1 += sCode[i, j].ToString(); } else { sEmpty = i * 3 + j; } if (dCode[i, j] != 0) { codeString2 += dCode[i, j].ToString(); } else { dEmpty = i * 3 + j; } endBoardArray[i * 3 + j] = dCode[i, j]; } startBoard = int.Parse(codeString1) * 10 + sEmpty + 1; endBoard = int.Parse(codeString2) * 10 + dEmpty + 1; if (startBoard == endBoard) return Answer.Exist; #endregion //test // false); broadOpenList.Enqueue(newNode); visitedList.AddSorted(newNode, SortedArrayList.CODE); int res; while (broadOpenList.Count > 0) { res = extendBroadOpenList(); if (res == 2) startBoard = 712548363; var newNode = new Node(startBoard, evalueFun(startBoard,0), 0, Direction.None, null,
#region 广度优先算法 /// <summary> /// 扩展结点 /// </summary> /// <returns>扩展结果</returns> private int extendBroadOpenList() { var openNode = (Node)broadOpenList.Dequeue(); int flag = 0; int emptyPos = openNode.code % 10 - 1; foreach (Direction dir in dirs[emptyPos]) { Node tempNode = MoveBlank(openNode, dir); if (tempNode.Goal) { setResult(tempNode); return 2;//达到目标 } if (tempNode == null) return flag;//结点不能展开 if (visitedList.AddSorted(tempNode, SortedArrayList.CODE))//未访问 { broadOpenList.Enqueue(tempNode); nodes++; flag = 1; } } return flag; } /// <summary> /// 广度优先算法 /// </summary> /// <param name="sCode">初始棋盘状态</param> /// <param name="dCode">目标棋盘状态</param> /// <param name="maxDepth">扩展最大深度</param> /// <returns></returns> public Answer broad(int[,] sCode, int[,] dCode, int maxDepth, int maxNodes) { MaxDepth = maxDepth; MaxNodes = maxNodes; nodes = 0;