weixin_44182138的博客

typedef struct{ int distance, path; bool visited;}Grap;typedef struct{ int to, cost;}Edge;Grap G[maxn];vector<Edge> E[maxn];void Dijkstra(Grap* G, int S, int T){ G[S].distance = 0; heap.insert(S); while(!heap.empty()) { int V = heap.

#include <cstdio>#include <iostream>using namespace std;//c++11 使用 bool rule1(int a, int b){ return a<b;}bool rule2(int a, int b){ return a>b;}void swap(auto &a, aut...