摘要：
群#include #include #include #include #include using namespace std;#include int a[205][205];int main(int argc, char *argv[]){ int m,n,i,j,k,r,p=0; stri... 阅读全文
摘要：
//1874#include #define N 205#define INF 10000000int g[N][N],bz[N],dist[N],s,t,n,m;void Dijkstra(int s){ int i,j,min,k,x; for (i=1;iw) g[x... 阅读全文
摘要：
c提交#includedouble map[102][102];void clear(int n){ int i,j;for(i=0;i<n;i++){ for(j=0;j<n;j++) { map[i][j]=-1; }}}double floyed(int n){int i,j,k... 阅读全文
摘要：
// 顶点从1 开始 floyed#include #define N 201#define INF 100000 int g[N][N],n,m;void floyed() { int i,j,k; for(k=1;kg[i][k]+g[k][j]) g[i][j]=g[i][k]+g[... 阅读全文
摘要：
// 顶点从1 开始 floyedvoid floyed() { int i,j,k; for(k=1;kg[i][k]+g[k][j]) g[i][j]=g[i][k]+g[k][j] ; } }// 顶点从0 开始 floyedvoid floyed() { int i... 阅读全文
摘要：
#include #define N 205#define INF 10000000int g[N][N],bz[N],dist[N],s,t,n,m;void Dijkstra(int s){ int i,j,min,k,x; for (i=1;i<=n;i++) { d... 阅读全文
摘要：
��.(790684394) 17:34:42#include #define N 2000#define INF 100000000int g[N][N],bz[N],dist[N],s,t,n,z;void Dijkstra(int s){ int i,j,min,k,x; f... 阅读全文
摘要：
//2544 G++ #include #define N 201#define INF 100000 int g[N][N],bz[N],dist[N],s,t,n,m;void Dijkstra(int s){ int i,j,min,k,x; for (i=1;i#define... 阅读全文
摘要：
//1874#include #define N 205#define INF 10000000int g[N][N],bz[N],dist[N],s,t,n,m;void Dijkstra(int s){ int i,j,min,k,x; for (i=1;iw) g[x... 阅读全文
摘要：
hnldyhy(303882171) 11:00:25// Dijkstra 邻接矩阵的下标从1开始 #include #define N 201#define INF 1000000000int g[N][N],bz[N],dist[N],s,t,n;void Dijkstra(int s){ ... 阅读全文