Dijkstra求最短路径

测试数据：

7 10
1 2 2
1 3 5
2 3 4
2 4 6
2 5 10
3 4 2
4 6 1
5 7 5
5 6 3
6 7 9

Code：

#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 pre[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();
            pre[i] = -1;
        }
        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;
                        pre[e.to] = e.from;
                        Q.push(HeapNode {e.to, dis[e.to]});
                    }
                }
                done[u] = true;
            }
        }
    }
    vector<int> get_path(int start, int dest) {
        this->dijkstra(start);//先调用dijkstra
        vector<int> v;
        for (;dest!=-1;dest=pre[dest]) {
            v.push_back(dest);
        }
        reverse(v.begin(), v.end());
        return v;
    }
    

};
int main()
{
    struct Dijkstra dj;
	int x, y, d, n, m;
	scanf("%d %d", &n, &m);
	dj.init(n);
	for (int i=1;i<=m;i++) {
		scanf("%d %d %d", &x, &y, &d);
		dj.AddEdge(x, y, d);
		dj.AddEdge(y, x, d);
	}
	dj.dijkstra(1);//计算从1到各点的距离

	for (int i=1;i<=dj.n;i++) {
		printf("%d%s", dj.dis[i], i==dj.n?"\n":" ");
	}


    vector<int> path = dj.get_path(1, 7);//返回从1到7的路径
    for (int i=0;i<path.size();i++) {
        printf("%d%s", path[i], i!=path.size()-1?"->":"\n");
    }
    
    return 0;
}