projects
/
morpheus.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Package v.1.0 ready to be sent to CRAN
[morpheus.git]
/
pkg
/
tests
/
testthat
/
test-hungarianAlgorithm.R
diff --git
a/pkg/tests/testthat/test-hungarianAlgorithm.R
b/pkg/tests/testthat/test-hungarianAlgorithm.R
index
591c3c1
..
3c333b0
100644
(file)
--- a/
pkg/tests/testthat/test-hungarianAlgorithm.R
+++ b/
pkg/tests/testthat/test-hungarianAlgorithm.R
@@
-8,16
+8,17
@@
test_that("HungarianAlgorithm provides the correct answer on various inputs",
{
# Generate a random vector, and permute it:
# we expect the algorithm to retrieve the permutation
{
# Generate a random vector, and permute it:
# we expect the algorithm to retrieve the permutation
- v
=
runif(n, min=-1, max=1)
- permutation
=
sample(1:n)
- v_p
=
v[permutation]
+ v
<-
runif(n, min=-1, max=1)
+ permutation
<-
sample(1:n)
+ v_p
<-
v[permutation]
# v is reference, v_p is v after permutation
# v is reference, v_p is v after permutation
- # distances[i,j] = distance between i-th component of v and j-th component of v_p
+ # distances[i,j] = distance between i-th component of v
+ # and j-th component of v_p
# "in rows : reference; in columns: after permutation"
# "permutation" contains order on v to match v_p as closely as possible
# "in rows : reference; in columns: after permutation"
# "permutation" contains order on v to match v_p as closely as possible
- distances
=
sapply(v_p, function(elt) ( abs(elt - v) ) )
- assignment
=
.hungarianAlgorithm(distances)
+ distances
<-
sapply(v_p, function(elt) ( abs(elt - v) ) )
+ assignment
<-
.hungarianAlgorithm(distances)
expect_equal(assignment, permutation)
}
}
expect_equal(assignment, permutation)
}
}