X-Git-Url: https://git.auder.net/?p=morpheus.git;a=blobdiff_plain;f=pkg%2Fsrc%2Fhungarian.c;fp=pkg%2Fsrc%2Fhungarian.c;h=3b2a28ddff65dae02550f15e767a1c74a171febc;hp=9671a438a1897ba0bbcb9c398a2812babebf2315;hb=f47183deb252f12d532af81a491083f1411cacc8;hpb=dfdd811f8488c88148c930eba94924fdbb7a3261

diff --git a/pkg/src/hungarian.c b/pkg/src/hungarian.c
index 9671a43..3b2a28d 100644
--- a/pkg/src/hungarian.c
+++ b/pkg/src/hungarian.c
@@ -112,7 +112,7 @@ void hungarian_free(hungarian_problem_t* p) {
 void hungarian_solve(hungarian_problem_t* p)
 {
   int i, j, m, n, k, l, t, q, unmatched;
-  double cost, s;
+  double s; //,cost
   int* col_mate;
   int* row_mate;
   int* parent_row;
@@ -122,7 +122,7 @@ void hungarian_solve(hungarian_problem_t* p)
   double* slack;
   int* slack_row;
 
-  cost = 0.;
+//  cost = 0.;
   m =p->num_rows;
   n =p->num_cols;
 
@@ -160,7 +160,7 @@ void hungarian_solve(hungarian_problem_t* p)
     for (k=1; k<m; k++)
       if (p->cost[k][l]<s)
         s=p->cost[k][l];
-    cost+=s;
+//    cost+=s;
     if (s!=0.)
       for (k=0; k<m; k++)
         p->cost[k][l]-=s;
@@ -335,11 +335,11 @@ done:
     }
     /*TRACE("\n");*/
   }
-  for (i=0; i<m; i++)
+/*  for (i=0; i<m; i++)
     cost+=row_dec[i];
   for (i=0; i<n; i++)
     cost-=col_inc[i];
-
+*/
   free(slack);
   free(col_inc);
   free(parent_row);