JavaFloyd算法求有权图（非负权）的最短路径并打印

public class FloydTest {
 private static int[][] matrix;

 private static int[][] path;

 public static void main(String[] args) {

  initMatrixAndPath(
      new int[][]{
          {0, 1, 8, 5},
          {1, 0, 7, 6},
          {8, 7, 0, 2},
          {5, 6, 2, 0}}
  );


  floyd(matrix, path);
  printShortDistance();
  printShortDistanceDetail();
 }

 private static void initMatrixAndPath(int[][] matrix) {
  FloydTest.matrix = matrix;
  FloydTest.path = new int[matrix.length][matrix.length];

  for (int i = 0; i  matrix[i][k] + matrix[k][j]) {
      matrix[i][j] = matrix[i][k] + matrix[k][j];
      path[i][j] = path[i][k];
     }
    }
  }


 }

 private static String getNodeName(int nodeIndex) {
  return "v" + nodeIndex;
 }

 private static void printShortDistanceDetail() {
  for (int i = 0; i