最短路径floyd（Shortest path Floyd）.docVIP

最短路径floyd（Shortest path Floyd） Multi-source shortest path; Floyd algorithm; collection Multi-source shortest path Floyd algorithm In fact, quite simple. The basic idea is a greedy method that constructs 1 two-dimensional matrices for iteration with a time complexity of O (n^3). The two-dimensional array g[][] represents the weight at the top of the graph (the direct distance between 2 points) The two-dimensional array weight[][] is the two-dimensional matrix we construct to store the shortest path that is currently being obtained. First, initialize the weight[][] with g[][] (the data copy to weight in the G) Next, walk through all nodes in the diagram V If g[i][v]+g[v][j]weight[i][j] So weight[i][j]=g[i][v]+g[v][j]? After traversing all the nodes, the shortest path between two points is stored in weight The proof process is not written, almost every algorithm book, and I think it is not necessary The following is the implementation of C G[i][j]=0 indicates no path from I to j Void Floyd (float, **g, long, N, float, **weight) { Long, I, J, k; For (i=0; in; i++) For (j=0; jn; j++) Weight[i][j]=g[i][j]; For (k=0; kn; k++) For (i=0; in; i++) { If (g[i][k]==0) Continue; For (j=0; jn; j++) { If (g[k][j]==0) Continue; If (weight[i][j]==0 || G[i][k]+g[k][j]weight[i][j]) Weight[i][j]=g[i][k]+g[k][j]; } } } Floyd algorithm #include iostream.h Int min (int, a, int, b) { Return ab? B:a?; } Int cost[10][10]= { 0, 99, 8, 7, 6, 5,, 4, 3, 2, 1, 99, 0, 99, 8, 7, 6,, 5, 4, 3, 2, 8, 99, 0, 99, 8, 7,, 6, 5, 4, 3, 7, 8, 99, 0, 99, 8,, 7, 6, 5, 4, 6, 7, 8, 99, 0, 99,, 8, 7, 6, 5, 5, 6, 7, 8, 99, 0,, 99, 8, 7, 6, 4, 5, 6, 7, 8, 99,, 0, 99, 8, 7, 3, 4, 5, 6, 7, 8,, 99, 0, 99, 8, 2, 3, 4, 5, 6, 7,, 8, 99, 0, 99, 1, 2, 3, 4, 5, 6,, 7, 8, 99, 0 }; Int best[10][10]; Void Floyd (int, cost[10][10], int, best[10][10]) { Int, I, J, k; For (i=0; i10; i++) For (j=0; j10; j++) Best[i][j]=cost[i][j]; For (i=0; i10; i++) For (j=0; j10; j++) For (k=0; j10; j++) { Best[j][k]=min (best[j][k], best[i][j]+b