de.cit-ec.tcs.alignment:sets 3.1.0

This module provides algorithms to compare sets, that is, order-invariant lists. These algorithms are implementations of the AlignmentAlgorithm interface defined in the algorithms module. In particular, this module contains the StrictSetAlignmentScoreAlgorithm for computing the cost of the optimal unordered alignment of two sets, the StrictSetAlignmentFullAlgorithm which provides the Alignment itself as well, and the GreedySetAlignmentScoreAlgorithm as well as the GreedySetAlignmentFullAlgorithm for computing a potentially sub-optimal but faster alignment of two sets. The optimal alignments rely on the HungarianAlgorithm for solving the assignment problem in bipartite graphs. Here, we rely on the implementation provided by Kevin L. Stern which is provided within this distribution.

<!-- https://jarcasting.com/artifacts/de.cit-ec.tcs.alignment/sets/ -->
<dependency>
    <groupId>de.cit-ec.tcs.alignment</groupId>
    <artifactId>sets</artifactId>
    <version>3.1.0</version>
</dependency>

// https://jarcasting.com/artifacts/de.cit-ec.tcs.alignment/sets/
implementation 'de.cit-ec.tcs.alignment:sets:3.1.0'

// https://jarcasting.com/artifacts/de.cit-ec.tcs.alignment/sets/
implementation ("de.cit-ec.tcs.alignment:sets:3.1.0")

'de.cit-ec.tcs.alignment:sets:jar:3.1.0'

<dependency org="de.cit-ec.tcs.alignment" name="sets" rev="3.1.0">
  <artifact name="sets" type="jar" />
</dependency>

@Grapes(
@Grab(group='de.cit-ec.tcs.alignment', module='sets', version='3.1.0')
)

libraryDependencies += "de.cit-ec.tcs.alignment" % "sets" % "3.1.0"

[de.cit-ec.tcs.alignment/sets "3.1.0"]