夏午Sharve的博客？

快速导航最短路径邻接矩阵Dij最短路径邻接矩阵Dij#include<bits/stdc++.h>using namespace std;const int maxn=1e2+10;const int inf=0x3f3f3f3f;int n,m;bool vis[maxn];int dis[maxn];int g[maxn][maxn];int main(){ while(~scanf("%d%d",&n,&m)&&m&am