I'm looking for a library that can rank / join an array of combinations, where the ranking is from a combination , Which gives you the combination of this gray code or lexicographic or some other algorithm, is backing up without any descending process.
I am trying a library such as gray codes, lexicographic, reggae-lexicographic, NUP etc. many algorithms.
If it only generates then it can be alright if it has many algorithms too.
I found the FXT library but it does not use sequential combinations; It works but I think that I do not need it as the algorithm of ranking, it is comparable to rank / unearthly extraordinary combinations.
This is not a great answer to your question, but .
It is perfectly balanced between the algorithmic / mathematical side and is an excellent book on this subject. Actual implementation Most examples are very simple that they are written in a procedural language much like C can go.
Comments
Post a Comment