code: protected void computeInitialFeasibleSolution() {
          for (int j = 0; j < dim; j++) {
              labelByJob[j] = Double.POSITIVE_INFINITY;
          }
          for (int w = 0; w < dim; w++) {
              for (int j = 0; j < dim; j++) {
                  if (costMatrix[w][j] < labelByJob[j]) {
                      labelByJob[j] = costMatrix[w][j];
                  }
              }
          }
      }
docs: Compute an initial feasible solution by assigning zero labels to the
  workers and by assigning to each job a label equal to the minimum cost
  among its incident edges.