点击打开链接
SPFA + A*
#include <cstdio>
#include <queue>
#include <cstring>
#include <algorithm>
using namespace std;
struct node {
int v, dis, f, next;
friend bool operator <(node a, node b){
return a.f>b.f;
}
};
const int INF = 1e9;
const int maxn = 1005;
const int maxm = 100005;
node edge[maxm], edgef[maxm];
int head[maxn], e, headf[maxn], dis[maxn], n, m, s, t, k;
void Add(int u, int v, int dis){
edge[e].v = v;
edge[e].dis = dis;
edge[e].n......
阅读全文