写成struct了
#include<iostream>
#include<queue>
#include<vector>
#include<algorithm>
const int maxn = 1007;
const int INF = 0x3f3f3f3f;
using namespace std;
struct Edge {
int from, to, dist;
Edge(int f, int t, int d):from(f), to(t), dist(d) {
}
};
struct HeapNode {
int u, d;
bool operator < (const HeapNode& other) const {
return d > other.d;
}
};
struct Dijkstra {
int n, m;
vector<Edge> edges;//edges[i]存储了编号为i的边的具体信息
vector<int> G[maxn];//G[u]是一个vector<int>,存储了节点u周围的边的编号
bool done[maxn];
int dis[maxn];//s到各个点的距离,即最终答案
void init(int n) {
this->n = n;
for (int i=0;i<=n;i++) {
done[i] = false;
dis[i] = INF;
G[i].clear();
}
edges.clear();
}
void AddEdge(int from, int to, int d) {
edges.push_back(Edge(from, to, d));
m = edges.size();
G[from].push_back(m - 1);//把与from直接相连的边在edges里的标号放到G[from]里,由于此时是从末尾入的vector,故标号就是edges.size()-1
}
void dijkstra(int s) {
dis[s] = 0;
priority_queue<HeapNode> Q;
Q.push(HeapNode{
s, 0});
while (!Q.empty()) {
HeapNode x = Q.top();Q.pop();
int& u = x.u;
if (!done[u]) {
for (int i=0;i<G[u].size();i++) {
Edge e = edges[G[u][i]];
if (dis[e.to] > dis[u] + e.dist) {
dis[e.to] = dis[u] + e.dist;
Q.push(HeapNode {
e.to, dis[e.to]});
}
}
done[u] = true;
}
}
}
};
int main()
{
struct Dijkstra dj;
int x, y, d, n, m;
cin>>n>>m;
dj.init(n);
for (int i=1;i<=m;i++) {
cin>>x>>y>>d;
dj.AddEdge(x, y, d);
dj.AddEdge(y, x, d);
}
dj.dijkstra(1);
for (int i=1;i<=dj.n;i++) {
cout<<dj.dis[i]<<" ";
}cout<<endl;
return 0;
}
然而本辣鸡还是不会输出最短的路径。。。