?? bfs.cpp
字號:
#include "stdafx.h"
#include "bfs.h"
extern HASH tree;
CString BFS::getIntroduction(){
CString intro = "廣度優先搜索\r\n\r\n"
"能保證找到最優解,搜索方式為逐層搜索。";
return intro;
}
int BFS::search(int begin, int end, int &stop, int val){
if((getreverse(begin) & 1) != (getreverse(end) & 1) ){ //逆序數不一樣,無解
result = NOANSWER;
return -1;
}
std::queue<int> Q;
result = SUCCESS;
open[0].father = -1;
open[0].step = 0;
open[0].status = begin;
int index, tmp;
for(index = 0, tmp = begin; tmp % 10; ++index, tmp /= 10);
open[0].zero = index;
Q.push(top = 0);
tree.reset();
tree.add(begin);
reset(begin, end); //初始轉換信息
while(!stop && !Q.empty()){
index = Q.front();
Q.pop();
if(open[index].status == end){
last_index = index;
totalnode = top;
expanded = top + 1 - Q.size();
inopen = Q.size();
return 1;
}
int zero = open[index].zero;
for(int i = 0; i < dir_count[zero]; i++){
int tmp = getnextstatus(open[index].status, zero, dir[zero][i]);
if(tree.add(tmp) ){
open[++top].father = index;
open[top].status = tmp;
open[top].step = open[index].step + 1;
open[top].zero = dir[zero][i];
Q.push(top);
}
}
}
expanded = top + 1 - Q.size();
inopen = Q.size();
if(stop){
result = STOP;
return -2;
}
result = CANTFIND;
return 0;
}
?? 快捷鍵說明
復制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號
Ctrl + =
減小字號
Ctrl + -