Java implementation of Floyd algorithm

Floyd algorithm: it is used to solve the shortest path from multiple sources. It calculates the shortest distance from all nodes to other nodes.

The idea of the algorithm is: first initialize the distance matrix, and then gradually update the point value of the matrix from the first point. D [i] [J] represents the distance from point I to point J. During the k-th update, judge the size of D [i] [k] + D [k] [J] and D [i] [J]. If the former is small, update this value, otherwise it remains unchanged.

Give an example:

The specific Floyd implementation algorithm is as follows [Java] view plain copy@H_301_12 @

After implementation, a test is given for the points and weights in the above figure: @ H_ 301_ 12@

The above is the whole content of this article. I hope it will be helpful to your study, and I hope you can support programming tips.