1 context("hungarianAlgorithm")
3 test_that("HungarianAlgorithm provides the correct answer on various inputs",
5 for (n in c(2,3,10,50))
7 for (repetition in 1:3)
9 # Generate a random vector, and permute it:
10 # we expect the algorithm to retrieve the permutation
11 v <- runif(n, min=-1, max=1)
12 permutation <- sample(1:n)
15 # v is reference, v_p is v after permutation
16 # distances[i,j] = distance between i-th component of v
17 # and j-th component of v_p
18 # "in rows : reference; in columns: after permutation"
19 # "permutation" contains order on v to match v_p as closely as possible
20 distances <- sapply(v_p, function(elt) ( abs(elt - v) ) )
21 assignment <- .hungarianAlgorithm(distances)
22 expect_equal(assignment, permutation)