public class HungarianAlgorithm extends Object
Constructor and Description |
---|
HungarianAlgorithm() |
Modifier and Type | Method and Description |
---|---|
static void |
clearCovers(int[] rowCover,
int[] colCover) |
static void |
convertPath(int[][] mask,
int[][] path,
int count) |
static double[][] |
copyOf(double[][] original) |
static void |
erasePrimes(int[][] mask) |
static double |
findLargest(double[][] array) |
static int |
findPrimeInRow(int[][] mask,
int row) |
static double |
findSmallest(double[][] cost,
int[] rowCover,
int[] colCover,
double maxCost) |
static int |
findStarInCol(int[][] mask,
int col) |
static int[] |
findUncoveredZero(int[] row_col,
double[][] cost,
int[] rowCover,
int[] colCover) |
static void |
generateRandomArray(double[][] array,
String randomMethod) |
static int |
hg_step1(int step,
double[][] cost) |
static int |
hg_step2(int step,
double[][] cost,
int[][] mask,
int[] rowCover,
int[] colCover) |
static int |
hg_step3(int step,
int[][] mask,
int[] colCover) |
static int |
hg_step4(int step,
double[][] cost,
int[][] mask,
int[] rowCover,
int[] colCover,
int[] zero_RC) |
static int |
hg_step5(int step,
int[][] mask,
int[] rowCover,
int[] colCover,
int[] zero_RC) |
static int |
hg_step6(int step,
double[][] cost,
int[] rowCover,
int[] colCover,
double maxCost) |
static int[][] |
hgAlgorithm(double[][] array,
String sumType) |
static void |
main(String[] args) |
static void |
printTime(double time) |
static int |
readInput(String prompt) |
static double[][] |
transpose(double[][] array) |
public static int readInput(String prompt)
public static void printTime(double time)
public static void generateRandomArray(double[][] array, String randomMethod)
public static double findLargest(double[][] array)
public static double[][] transpose(double[][] array)
public static double[][] copyOf(double[][] original)
public static int[][] hgAlgorithm(double[][] array, String sumType)
public static int hg_step1(int step, double[][] cost)
public static int hg_step2(int step, double[][] cost, int[][] mask, int[] rowCover, int[] colCover)
public static int hg_step3(int step, int[][] mask, int[] colCover)
public static int hg_step4(int step, double[][] cost, int[][] mask, int[] rowCover, int[] colCover, int[] zero_RC)
public static int[] findUncoveredZero(int[] row_col, double[][] cost, int[] rowCover, int[] colCover)
public static int hg_step5(int step, int[][] mask, int[] rowCover, int[] colCover, int[] zero_RC)
public static int findStarInCol(int[][] mask, int col)
public static int findPrimeInRow(int[][] mask, int row)
public static void convertPath(int[][] mask, int[][] path, int count)
public static void erasePrimes(int[][] mask)
public static void clearCovers(int[] rowCover, int[] colCover)
public static int hg_step6(int step, double[][] cost, int[] rowCover, int[] colCover, double maxCost)
public static double findSmallest(double[][] cost, int[] rowCover, int[] colCover, double maxCost)
public static void main(String[] args)
(C) INRIA, Univ. Grenoble Alpes & friends, 2008-2017