src.digit[i][j] = number; }
src.index = 0; src.dep = 1;
cout<< \输入目标状态\for (int m = 0; m < ROW; m++) for (int n = 0; n < COL; n++) { cin>> number;
dest.digit[m][n] = number; }
node_v.push_back(src);
while (1) {
if (isEmptyOfOPEN()) { cout<< \找不到解!\return -1; } else {
intloc; // the location of the minimize node loc = GetMinNode();
if(isEqual(loc, dest.digit)) { vector
cout<< \初始状态:\cout< PrintSteps(loc, rstep_v); cout<< \成功!\break; } else ProcessNode(loc); } } return 0; } 百度搜索“77cn”或“免费范文网”即可找到本站免费阅读全部范文。收藏本站方便下次阅读,免费范文网,提供经典小说综合文库八数码问题C语言A星算法详细实验报告含代码(3)在线全文阅读。
相关推荐: