[Floyd算法实现]
(程序中graph.h是图存储结构的“算法库”中的头文件,详情请单击链接…)
#include <stdio.h>#include <malloc.h>#include "graph.h"#define MaxSize 100void Ppath(int path[][MAXV],int i,int j) { int k; k=path[i][j]; if (k==-1) return; Ppath(path,i,k); printf("%d,",k); Ppath(path,k,j); }void Dispath(int A[][MAXV],int path[][MAXV],int n){ int i,j; for (i=0; i<n; i++) for (j=0; j<n; j++) { if (A[i][j]==INF) { if (i!=j) printf("从%d到%d没有路径\n",i,j); } else { printf(" 从%d到%d=>路径长度:%d 路径:",i,j,A[i][j]); printf("%d,",i); Ppath(path,i,j); printf("%d\n",j); } }}void Floyd(MGraph g){ int A[MAXV][MAXV],path[MAXV][MAXV]; int i,j,k; for (i=0; i<g.n; i++) for (j=0; j<g.n; j++) { A[i][j]=g.edges[i][j]; path[i][j]=-1; } for (k=0; k<g.n; k++) { for (i=0; i<g.n; i++) for (j=0; j<g.n; j++) if (A[i][j]>A[i][k]+A[k][j]) { A[i][j]=A[i][k]+A[k][j]; path[i][j]=k; } } Dispath(A,path,g.n); }int main(){ MGraph g; int A[4][4]= { {0, 5,INF,7}, {INF,0, 4,2}, {3, 3, 0,2}, {INF,INF,1,0} }; ArrayToMat(A[0], 4, g); Floyd(g); return 0;}
[Floyd算法实现]
(程序中graph.h是图存储结构的“算法库”中的头文件,详情请单击链接…)
#include <stdio.h>#include <malloc.h>#include "graph.h"#define MaxSize 100void Ppath(int path[][MAXV],int i,int j) { int k; k=path[i][j]; if (k==-1) return; Ppath(path,i,k); printf("%d,",k); Ppath(path,k,j); }void Dispath(int A[][MAXV],int path[][MAXV],int n){ int i,j; for (i=0; i<n; i++) for (j=0; j<n; j++) { if (A[i][j]==INF) { if (i!=j) printf("从%d到%d没有路径\n",i,j); } else { printf(" 从%d到%d=>路径长度:%d 路径:",i,j,A[i][j]); printf("%d,",i); Ppath(path,i,j); printf("%d\n",j); } }}void Floyd(MGraph g){ int A[MAXV][MAXV],path[MAXV][MAXV]; int i,j,k; for (i=0; i<g.n; i++) for (j=0; j<g.n; j++) { A[i][j]=g.edges[i][j]; path[i][j]=-1; } for (k=0; k<g.n; k++) { for (i=0; i<g.n; i++) for (j=0; j<g.n; j++) if (A[i][j]>A[i][k]+A[k][j]) { A[i][j]=A[i][k]+A[k][j]; path[i][j]=k; } } Dispath(A,path,g.n); }int main(){ MGraph g; int A[4][4]= { {0, 5,INF,7}, {INF,0, 4,2}, {3, 3, 0,2}, {INF,INF,1,0} }; ArrayToMat(A[0], 4, g); Floyd(g); return 0;}
[Floyd算法实现]
(程序中graph.h是图存储结构的“算法库”中的头文件,详情请单击链接…)
#include <stdio.h>#include <malloc.h>#include "graph.h"#define MaxSize 100void Ppath(int path[][MAXV],int i,int j) { int k; k=path[i][j]; if (k==-1) return; Ppath(path,i,k); printf("%d,",k); Ppath(path,k,j); }void Dispath(int A[][MAXV],int path[][MAXV],int n){ int i,j; for (i=0; i<n; i++) for (j=0; j<n; j++) { if (A[i][j]==INF) { if (i!=j) printf("从%d到%d没有路径\n",i,j); } else { printf(" 从%d到%d=>路径长度:%d 路径:",i,j,A[i][j]); printf("%d,",i); Ppath(path,i,j); printf("%d\n",j); } }}void Floyd(MGraph g){ int A[MAXV][MAXV],path[MAXV][MAXV]; int i,j,k; for (i=0; i<g.n; i++) for (j=0; j<g.n; j++) { A[i][j]=g.edges[i][j]; path[i][j]=-1; } for (k=0; k<g.n; k++) { for (i=0; i<g.n; i++) for (j=0; j<g.n; j++) if (A[i][j]>A[i][k]+A[k][j]) { A[i][j]=A[i][k]+A[k][j]; path[i][j]=k; } } Dispath(A,path,g.n); }int main(){ MGraph g; int A[4][4]= { {0, 5,INF,7}, {INF,0, 4,2}, {3, 3, 0,2}, {INF,INF,1,0} }; ArrayToMat(A[0], 4, g); Floyd(g); return 0;}
[Floyd算法实现]
(程序中graph.h是图存储结构的“算法库”中的头文件,详情请单击链接…)
#include <stdio.h>#include <malloc.h>#include "graph.h"#define MaxSize 100void Ppath(int path[][MAXV],int i,int j) { int k; k=path[i][j]; if (k==-1) return; Ppath(path,i,k); printf("%d,",k); Ppath(path,k,j); }void Dispath(int A[][MAXV],int path[][MAXV],int n){ int i,j; for (i=0; i<n; i++) for (j=0; j<n; j++) { if (A[i][j]==INF) { if (i!=j) printf("从%d到%d没有路径\n",i,j); } else { printf(" 从%d到%d=>路径长度:%d 路径:",i,j,A[i][j]); printf("%d,",i); Ppath(path,i,j); printf("%d\n",j); } }}void Floyd(MGraph g){ int A[MAXV][MAXV],path[MAXV][MAXV]; int i,j,k; for (i=0; i<g.n; i++) for (j=0; j<g.n; j++) { A[i][j]=g.edges[i][j]; path[i][j]=-1; } for (k=0; k<g.n; k++) { for (i=0; i<g.n; i++) for (j=0; j<g.n; j++) if (A[i][j]>A[i][k]+A[k][j]) { A[i][j]=A[i][k]+A[k][j]; path[i][j]=k; } } Dispath(A,path,g.n); }int main(){ MGraph g; int A[4][4]= { {0, 5,INF,7}, {INF,0, 4,2}, {3, 3, 0,2}, {INF,INF,1,0} }; ArrayToMat(A[0], 4, g); Floyd(g); return 0;}