Hungarian-Munkres 0.1.1 → 0.1.2

raw patch · 2 files changed

+73/−2 lines, 2 files

Files

• Hungarian-Munkres.cabal +5/−2
• cbits/hungarian.h +68/−0

@@ -2,7 +2,7 @@ -- documentation, see http://haskell.org/cabal/users-guide/  name:                Hungarian-Munkres-version:             0.1.1+version:             0.1.2 synopsis:            A Linear Sum Assignment Problem (LSAP) solver description:         This library provide a Haskell binding to the libhungarian,                      a solver for Linear Sum Assignment Problem (LSAP) implemented@@ -25,7 +25,10 @@   -- other-extensions:       build-depends:       base >=4.7 && <4.8   hs-source-dirs:      src-  c-sources:           cbits/hungarian.c+  c-sources:+      cbits/hungarian.c+    , cbits/hungarian.h+   default-language:    Haskell2010  test-suite             tests

@@ -0,0 +1,68 @@+/********************************************************************+ ********************************************************************+ **+ ** libhungarian by Cyrill Stachniss, 2004+ **+ **+ ** Solving the Minimum Assignment Problem using the + ** Hungarian Method.+ **+ ** ** This file may be freely copied and distributed! **+ **+ ** Parts of the used code was originally provided by the + ** "Stanford GraphGase", but I made changes to this code.+ ** As asked by  the copyright node of the "Stanford GraphGase", + ** I hereby proclaim that this file are *NOT* part of the+ ** "Stanford GraphGase" distrubition!+ **+ ** This file is distributed in the hope that it will be useful,+ ** but WITHOUT ANY WARRANTY; without even the implied + ** warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR+ ** PURPOSE.  + **+ ********************************************************************+ ********************************************************************/++#ifndef HUNGARIAN_H+#define HUNGARIAN_H++#ifdef __cplusplus+extern "C" {+#endif+  +#define HUNGARIAN_NOT_ASSIGNED 0 +#define HUNGARIAN_ASSIGNED 1++#define HUNGARIAN_MODE_MINIMIZE_COST   0+#define HUNGARIAN_MODE_MAXIMIZE_UTIL 1+++typedef struct {+  int num_rows;+  int num_cols;+  double** cost;+  int** assignment;  +} hungarian_problem_t;++double hungarian(double* data, int* result, int rows, int cols);++/** This method initialize the hungarian_problem structure and init + *  the  cost matrices (missing lines or columns are filled with 0).+ *  It returns the size of the quadratic(!) assignment matrix. **/+int hungarian_init(hungarian_problem_t* p, +		   double* cost_matrix, +		   int rows, +		   int cols, +		   int mode);+  +/** Free the memory allocated by init. **/+void hungarian_free(hungarian_problem_t* p);++/** This method computes the optimal assignment. **/+double hungarian_solve(hungarian_problem_t* p);++#ifdef __cplusplus+}+#endif++#endif