Indexing combinations from two finite sets.
Project description
KombiN - Python 3 Library
This is the python implementation of KombiN, which is an algorithm to get index for combination pair and to get combination pair from index, where all possible combination pairs from two finite sets are sorted by their weight in ascending order.
Installation
Available on pypi
pip install kombin-algo-pranavpatel-ca
Usage
where set 'A' has 100 elements and set 'B' has 80 elements and both sets has zerobased indexing.
from kombin import Table
# Initialize object of Table class
myObj = Table(100, 80, true)
# Get Index value for combination pair(ai: 46, bi: 72)
index = myObj.GetIndexOfElements(46, 72)
# Get combination pair from index value
ai, bi = myObj.GetElementsAtIndex(index);
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Close
Hashes for kombin_algo_pranavpatel_ca-1.0.0.tar.gz
Algorithm | Hash digest | |
---|---|---|
SHA256 | 063ae9d33beb26497126f10997b574482dc37a435a59bf4aab51345e9b947f97 |
|
MD5 | 15522bebbc2e0ef741f0f75a9561d482 |
|
BLAKE2b-256 | e2063bd581337af90e8c4869ee29c3908f6fe1ecc25df17c8207eeeaea7e7ff2 |
Close
Hashes for kombin_algo_pranavpatel_ca-1.0.0-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 78171a0b2c061487fef2b0b4dfb87cd5e792ffdba00bc8038baf103875742574 |
|
MD5 | d3cb9e2761be61e88e486e723ab17437 |
|
BLAKE2b-256 | dec53f16d895eab8a12f8be2065bea6f45faaf6e241d76e9a22135d091406cd1 |