StackGenVis: Alignment of Data, Algorithms, and Models for Stacking Ensemble Learning Using Performance Metrics
https://doi.org/10.1109/TVCG.2020.3030352
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
|
4 years ago | |
---|---|---|
.. | ||
test | 4 years ago | |
.npmignore | 4 years ago | |
LICENSE | 4 years ago | |
README.md | 4 years ago | |
index.js | 4 years ago | |
package.json | 4 years ago |
README.md
permutation-rank
Ranks and unranks permutations. Based on the following paper:
W. Myrvold, F. Ruskey. (2000) "Ranking and Unranking Permutations in Linear Time". Information Processing Letters.
Usage
First install using npm:
npm install permutation-rank
Then you can use it like this:
var prank = require("permutation-rank")
var perm = [0,3,1,2]
var r = prank.rank(perm)
console.log("r = ", r)
var u = prank.unrank(perm.length, r)
console.log("u = ", u)
//Prints:
// r = 15
// u = [ 0, 3, 1, 2 ]
prank.rank(permutation)
Computes an integer representing the colexicographic rank of the permutation
permutation
is an array encoding some permutation
Returns An integer representing the ranked encoding of the permutation
prank.unrank(length, rank[, result])
Computes a permutation from a rank order with the given length
length
is the length of the permuationrank
is the index of the permutationresult
is an optional argument which stores the result of the inversion
Returns The permutation at the given rank
Credits
(c) 2013 Mikola Lysenko. MIT License