Method solve

tracking/src/munkres.cpp:316–406

    }

    cv::Mat
    Munkres::solve(cv::Mat& matrix_in, bool max)
    {
      // Preprocessing:
      double** matrix = preprocess(matrix_in, max);

      int max_dim = MAX(matrix_in.rows, matrix_in.cols);
      int rows = max_dim;
      int cols = max_dim;

      bool done = false;
      int step = 1;
      int* rowCover = new int[rows];
      int* colCover = new int[cols];
      double** m = new double*[rows];
      int path_row_0 = 0;
      int path_col_0 = 0;
      int path_count = 0;
      for (int j = 0; j < cols; j++) {
        colCover[j] = 0;
      }
      for (int i = 0; i < rows; i++) {
        rowCover[i] = 0;
        m[i] = new double[cols];
        for (int j = 0; j < cols; j++) {
          m[i][j] = 0;
        }
      }
      int** path = new int*[rows*cols];
      for (int i = 0; i < rows*cols; i++) {
        path[i] = new int[2];
      }

      // Main loop:
      while (!done) {
        switch (step) {
          case 1:
            step_one(matrix, rows, cols, step);
            break;
          case 2:
            step_two(matrix, rows, cols, rowCover, colCover, m, step);
            break;
          case 3:
            step_three(rows, cols, colCover, m, step);
            break;
          case 4:
            step_four(matrix, rows, cols, rowCover, colCover, m, path_row_0, path_col_0,
                step);
            break;
          case 5:
            step_five(rows, cols, rowCover, colCover, m, path_row_0, path_col_0,
                path_count, path, step);
            break;
          case 6:
            step_six(matrix, rows, cols, rowCover, colCover, step);
            break;
          case 7:
            done = true;