ppt课件-程序设计实习.pptVIP

if( bFound ) { int nTotal = 0; int i = nHead; while( i != -1 ) { nTotal ++; i = Queue[i].nFather; } return nTotal - 1; } else return -1; } int main() { int i,j,k; while(1) { cin M N; if( M == 0 N == 0 ) break; memset( Maze,#,sizeof(Maze)); for( i = 1;i = M; i ++ ) for( j = 1; j = N; j ++ ) { cin Maze[i][j]; if( Maze[i][j] == @ ) { nStartR = i; nStartC = j; Maze[i][j] = .; } else if( Maze[i][j] == * ) { nDestR = i; nDestC = j; Maze[i][j] = .; } } cout Bfs() endl; } } Blah数集 Description： 大数学家高斯小时候偶