leetcode787. K 站中转内最便宜的航班

Dijkstra求最短路径

Dijkstra求最短路径原题链接代码#include<iostream>#include<cstring>using namespace std;const int N=510,M=1e5+10,INF=0x3f3f3f3f;int n,m,g[N][N],dist[N];

acwing853. 有边数限制的最短路

#include<iostream>#include<cstring>using namespace std;const int N=510,M=10010;int n,m,k;int dist[N],last[N];struct Edge{ int a,b,c;

Floyd求最短路径

Floyd求最短路径原题链接#include<iostream>#include<cstring>using namespace std;const int N=210,M=20010,INF=0x3f3f3f3f;int g[N][N];int n,m,Q;int main