改进基于优先队列的最短路径搜索『洪水流思想的体现』

最新推荐文章于 2023-10-29 18:34:18 发布

一枝春美食

最新推荐文章于 2023-10-29 18:34:18 发布

阅读量862

点赞数 1

分类专栏：编程之美 c/c++ 文章标签：队列算法

本文链接：https://blog.csdn.net/u010442328/article/details/46998747

版权

本文介绍了如何使用优先队列改进最短路径搜索算法，特别是针对需要时间加倍的情况。通过分析博客中提供的示例，解释了算法的工作原理，即从起点开始向外扩展，利用优先队列存储路径长度，直至找到目标点。这种搜索方法类似于洪水流算法，可以用于路径长度和路径本身的记录。最后，文章展示了如何通过保存权重和回溯找到返回起点的路径。

摘要由CSDN通过智能技术生成

这问题是在博客上看到的，为此学习一下，然后在他的基础上，修改完成迷宫洪水流算法的实现

题目是

Problem Description
Angel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M <= 200) matrix. There are WALLs, ROADs, and GUARDs in the prison.

Angel's friends want to save Angel. Their task is: approach Angel. We assume that "approach Angel" is to get to the position where Angel stays. When there's a guard in the grid, we must kill him (or her?) to move into the grid. We assume that we moving up, down, right, left takes us 1 unit time, and killing a guard takes 1 unit time, too. And we are strong enough to kill all the guards.

You have to calculate the minimal time to approach Angel. (We can move only UP, DOWN, LEFT and RIGHT, to the neighbor grid within bound, of course.)


Input
First line contains two integers stand for N and M.

Then N lines follows, every line has M characters. "." stands for road, "a" stands for Angel, and "r" stands for each of Angel's friend. 

Process to the end of the file.


Output
For each test case, your program should output a single integer, standing for the minimal time needed. If such a number does no exist, you should output a line containing "Poor ANGEL has to stay in the prison all his life." 


Sample Input
7 8
#.#####.
#.a#..r.
#..#x...
..#..#.#
#...##..
.#......
........


Sample Output
13

先给出博主的算法
http://www.cnblogs.com/heqinghui/archive/2013/07/30/3225407.html
源代码

#include <iostream>
#include <queue>
#include <algorithm>
#include <fstream>
#include <string>
using namespace std;


typedef struct p
{
    int x,y,t;
    bool operator < (const p &a) const
    {
        return t>a.t;
    }
}Point;


char map[20][20];
Point start;
int n,m;
int dir[][2]={
  {
  1,0},{-1,0},{
  0,1},{
  0,-1}};

void show()
{
    cout<<endl;
    for(int i=0;i<n;++i)