参考视频:https://www.bilibili.com/video/BV1Ut41197NX
算法思路:逐个顶点试探,找出从顶点Vi到顶点Vj所有可能存在的路径中最短的路径。
最后二维数组dis中存放的是任意两个顶点间的最短路径,路径可以通过pre数组求出。
package algorithm;
import java.util.Arrays;
public class Floyd {
char[] vertex;
int[][] edges;
int[][] dis;
int[][] pre;
private static final int N = 65535;
public Floyd(char[] vertex, int[][] edges) {
this.vertex = vertex;
this.edges = edges;
this.dis = edges;