X-Git-Url: https://git.auder.net/?p=morpheus.git;a=blobdiff_plain;f=pkg%2Fsrc%2Fhungarian.c;h=7850f641a353e39dc0479c3707c51920b208f3aa;hp=3a3a5ec66333ba4f1191db387b65601194a90b65;hb=324febd30a6fbf63d805dc76f1ac7aed8fead915;hpb=9007ccc114c127211639e7c5b82495bc39803eb0

diff --git a/pkg/src/hungarian.c b/pkg/src/hungarian.c
index 3a3a5ec..7850f64 100644
--- a/pkg/src/hungarian.c
+++ b/pkg/src/hungarian.c
@@ -90,8 +90,7 @@ int hungarian_init(hungarian_problem_t* p, double** cost_matrix, int rows, int c
 		// nothing to do
 	}
 //	else
-//		fprintf(stderr,"%s: unknown mode. Mode was set to \
-//			HUNGARIAN_MODE_MINIMIZE_COST !\n", __FUNCTION__);
+//		fprintf(stderr,"%s: unknown mode. Mode was set to HUNGARIAN_MODE_MINIMIZE_COST !\n", __FUNCTION__);
 
 	return rows;
 }
@@ -370,8 +369,7 @@ double** array_to_matrix(double* m, int rows, int cols)
 }
 
 //TODO: re-code this algorithm in a more readable way, based on
-//https://www.topcoder.com/community/data-science/data-science-tutorials/\
-//  assignment-problem-and-hungarian-algorithm/
+//https://www.topcoder.com/community/data-science/data-science-tutorials/assignment-problem-and-hungarian-algorithm/
 // Get the optimal assignment, by calling hungarian_solve above; "distances" in columns
 void hungarianAlgorithm(double* distances, int* pn, int* assignment)
 {