基于C语言的广度优先有哪些信誉好的足球投注网站.doc

基于C语言的广度优先搜素算法的实现 算法说明 广度优先有哪些信誉好的足球投注网站使用队列（queue）来实现，整个过程也可以看做一个倒立的树形： （1）把根节点放到队列的末尾。 （2）每次从队列的头部取出一个元素，查看这个元素所有的下一级元素，把它们放到队列的末尾。并把这个元素记为它下一级元素的前驱。 （3）找到所要找的元素时结束程序。 （4）如果遍历整个树还没有找到，结束程序。 本次算法的应用中，我用这个队列来保存最短路径。首先我定义队列为“真进假出”，所谓“真进”就是当添加一个元素时，把元素放置队尾，然后rear++, 而“假出”就是当删除一个元素时，并没有真的删除队首元素，只是front++。 通过比较有哪些信誉好的足球投注网站所得的所有可行路径的长度，这样我们就可以从队列中获取一条最短路径！ 代码及结果 #include stdio.h #define N 20 typedef struct{ int x; int y; }Node; /*队ó元a素?类え?型í*/ typedef struct{ int parent; /*双?亲×的?序ò号?*/ int child; /*双?亲×的?序ò号?*/ Node childpos; /*孩￠子哩?的?坐?标括?/ }QType; int Maze[N][N] = { 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 1,0,0,0,1,0,0,0,1,1,0,0,1,0,0,0,0,0,1,1, 1,0,0,1,0,0,0,0,1,0,0,0,0,1,1,1,0,0,0,1, 1,0,0,0,0,0,0,1,0,0,1,0,0,0,1,0,1,0,0,1, 1,1,0,1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,1, 1,0,0,0,0,1,0,0,0,0,1,0,0,0,0,1,0,0,1,1, 1,1,0,0,0,0,1,1,0,1,0,0,1,0,1,0,1,0,0,1, 1,1,0,0,1,0,0,0,1,0,1,0,0,0,0,0,0,0,1,1, 1,0,0,1,0,1,0,1,0,1,0,0,0,1,1,1,0,0,0,1, 1,1,0,0,0,0,0,1,0,0,0,1,0,0,0,0,1,0,0,1, 1,0,0,0,1,0,0,0,0,1,0,0,1,1,0,0,0,1,0,1, 1,1,1,1,0,1,0,0,1,0,1,0,0,0,1,1,1,0,1,1, 1,0,0,1,0,0,0,1,0,0,1,0,0,0,0,1,1,1,0,1, 1,0,1,1,1,1,1,0,0,0,1,0,0,1,0,0,0,0,0,1, 1,1,0,0,0,0,0,1,0,0,1,0,0,0,1,0,1,0,1,1, 1,0,0,0,1,0,0,0,0,1,0,0,0,0,0,1,0,1,1,1, 1,1,0,0,1,0,1,0,0,1,0,0,1,0,0,0,1,0,0,1, 1,0,0,0,1,0,0,0,1,0,0,1,0,0,0,1,0,0,0,1, 1,1,0,0,0,1,0,0,0,1,0,0,0,1,0,0,0,1,0,1, 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}; int visited[N][N] = {1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 1,0,0,0,1,0,0,0,1,1,0,0,1,0,0,0,0,0,1,1, 1,0,0,1,0,0,0,0,1,0,0,0,0,1,1,1,0,0,0,1, 1,0,0,0,0,0,0,1,0,0,1,0,0,0,1,0,1,0,0,1, 1,1,0,1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,1, 1,0,0,0,0,1,0,0,0,0,1,0,0,0,0,1,0,0,1,1, 1,1,0,0,0,0,1,1,0,1,0,0,1,0,1,0,1,0,0,1, 1,1,0,0,1,0,0,0,1,0,1,0,0,0,0,0,0,0,1,1, 1,0,0,1,0,1,0,1,0,1,0,0,0,1,1,1,0,0,0,1, 1,1,0,0,0,0,0,1,0,0,0,1,0,0,0,0,