八数码问题C语言A星算法详细实验报告含代码(3)

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)) { vectorrstep_v;

cout<< \初始状态：\cout<

PrintSteps(loc, rstep_v); cout<< \成功!\break; } else

ProcessNode(loc); } }

return 0; }