Find subsets which contain no pairs of very similar elements.
This implements a solution from Stack Exchange
and compares it to random and greedy approahces. See the notebook
compare_algorithms for a demonstration.
Requires numpy and networkx.
prashjet/dissimilar_subsets
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|