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.
-
Notifications
You must be signed in to change notification settings - Fork 0
Find subsets which contain no pairs of very similar elements.
License
prashjet/dissimilar_subsets
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Find subsets which contain no pairs of very similar elements.
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published