A*寻路算法include include include include

using namespace std;

typedef pair pii;//距离,顶点

struct Arc

{

};

const int MAX_VEX_NUM = 1010;

const int MAX = 1<<20;

vector Adjlist[MAX_VEX_NUM];

vector AdjlistRev[MAX_VEX_NUM];//反向图,求h(n)

int h[MAX_VEX_NUM];

int S,T,K;

void Init()

}

//计算h[n]

void Dijkstra(int u)

int Astar(int s, int t, int k)

int main()