ninja.pranav.algorithms:kombin

KombiN is an algorithm to get index for combination pair or to get combination pair from index, where all possible combination pairs from two finite sets are sorted by their weight in ascending order.

License	MIT License
Categories	Ninja User Interface Web Frameworks
GroupId	ninja.pranav.algorithms
ArtifactId	kombin
Last Version	1.0.0
Release Date	Feb 9, 2021
Type	jar
Description	ninja.pranav.algorithms:kombin KombiN is an algorithm to get index for combination pair or to get combination pair from index, where all possible combination pairs from two finite sets are sorted by their weight in ascending order.
Project URL	https://github.com/pranav-ninja/KombiN
Source Code Management	https://github.com/pranav-ninja/KombiN/tree/master/

Download kombin

Filename	Size
kombin-1.0.0.pom
kombin-1.0.0.jar	5 KB
kombin-1.0.0-sources.jar	4 KB
kombin-1.0.0-javadoc.jar	395 KB

How to add to project

Apache Maven

<!-- https://jarcasting.com/artifacts/ninja.pranav.algorithms/kombin/ -->
<dependency>
    <groupId>ninja.pranav.algorithms</groupId>
    <artifactId>kombin</artifactId>
    <version>1.0.0</version>
</dependency>

Gradle Groovy

// https://jarcasting.com/artifacts/ninja.pranav.algorithms/kombin/
implementation 'ninja.pranav.algorithms:kombin:1.0.0'

Gradle Kotlin

// https://jarcasting.com/artifacts/ninja.pranav.algorithms/kombin/
implementation ("ninja.pranav.algorithms:kombin:1.0.0")

Apache Buildr

'ninja.pranav.algorithms:kombin:jar:1.0.0'

Apache Ivy

<dependency org="ninja.pranav.algorithms" name="kombin" rev="1.0.0">
  <artifact name="kombin" type="jar" />
</dependency>

Groovy Grape

@Grapes(
@Grab(group='ninja.pranav.algorithms', module='kombin', version='1.0.0')
)

Scala SBT

libraryDependencies += "ninja.pranav.algorithms" % "kombin" % "1.0.0"

Leiningen

[ninja.pranav.algorithms/kombin "1.0.0"]

Dependencies

test (1)

Group / Artifact	Type	Version
junit : junit	jar	4.13.1

Project Modules

There are no modules declared in this project.

KombiN

KombiN is an algorithm that gives Index # of weighted combination and back, works with combinations of two finite sets ordered by sum and then by difference of combination, without generating and enumerating through possible combinations.

When to use KombiN?

Let's say we have two sets:

Set A = { Apple = 0, Banana = 1, Cucumber = 2 }

Set B = { CEO = 0, CFO = 1, CSO = 2 }

Now get all possible unique combinations for both sets and sort first by sum of combination and after by difference of combination and in the end give Index # to all combinations.

In above example, both sets have zero-based index so KombiN will have output as shown in left side Table below. For example, both sets are in DataTable with Non-zero index, In that case KombiN will have output as shown in right side Table below.

In short, It provides zero and non-zero index based on type of index used in both sets.

Index #	ai	bi			Index #	ai	bi
0	0	0			1	1	1
1	0	1			2	1	2
2	1	0			3	2	1
3	0	2			4	1	3
4	1	1			5	2	2
5	2	0			6	3	1
6	1	2			7	2	3
7	2	1			8	3	2
8	2	2			9	3	3

You can use KombiN for

1. Finding the Index # of particular combination
2. Finding the Combination of particular Index #.

Versions

Version
1.0.0 Feb 9, 2021