Efficient exact cover solver.

exact-cover alternatives and similar packages

Based on the "Algorithms" category

• build

  9.4 7.8 exact-cover VS build

  Build systems a la carte

• arithmoi

  9.4 8.7 exact-cover VS arithmoi

  Efficient basic number-theoretic functions. Primes, powers, integer logarithms.

• toysolver

  9.1 7.8 exact-cover VS toysolver

  Assorted decision procedures for SAT, Max-SAT, PB, MIP, etc

• ersatz

  9.1 5.4 exact-cover VS ersatz

  A monad for expressing SAT or QSAT problems using observable sharing.

• iproute

  8.8 3.3 exact-cover VS iproute

  IP Routing Table

• primes

  8.3 0.0 exact-cover VS primes

  Efficient, purely functional generation of prime numbers

• graphs

  8.2 3.8 exact-cover VS graphs

  A simple monadic graph library

• funsat

  8.1 0.0 exact-cover VS funsat

  A modern DPLL-style SAT solver

• HMM

  7.9 0.0 exact-cover VS HMM

  A hidden markov model library

• union-find

  7.8 0.0 exact-cover VS union-find

  Efficient union and equivalence testing of sets.

• aeson-diff

  7.8 2.4 exact-cover VS aeson-diff

  Extract and apply patches to JSON documents.

• imj-animation

  7.8 0.4 exact-cover VS imj-animation

  Animation Framework

• presburger

  7.4 0.4 exact-cover VS presburger

  A decision procedure for quantifier-free linear arithmetic.

• text-metrics

  7.2 5.1 exact-cover VS text-metrics

  Calculate various string metrics efficiently

• Adaptive

  7.1 0.0 exact-cover VS Adaptive

  Library for incremental computing.

• edit-distance

  7.0 2.7 exact-cover VS edit-distance

  Levenshtein and restricted Damerau-Levenshtein edit distances

• lca

  6.8 3.8 exact-cover VS lca

  O(log n) persistent on-line lowest common ancestor calculation without preprocessing

• dtw

  6.5 0.0 exact-cover VS dtw

  (Fast) Dynamic Time Warping

• treeviz

  6.3 0.0 exact-cover VS treeviz

  Visualization of computation decomposition trees.

• qchas

  6.2 0.3 exact-cover VS qchas

  A library for implementing Quantum Algorithms

• ADPfusion

  6.2 0.0 exact-cover VS ADPfusion

  Efficient, high-level dynamic programming.

• incremental-sat-solver

  6.1 0.0 exact-cover VS incremental-sat-solver

  Simple, Incremental SAT Solving as a Library

• ListTree

  5.3 0.0 exact-cover VS ListTree

  Trees and monadic trees expressed as monadic lists where the underlying monad is a list

• cmaes

  5.0 0.0 L1 exact-cover VS cmaes

  CMA-ES wrapper in Haskell

• search-algorithms

  5.0 0.0 exact-cover VS search-algorithms

  Common graph search algorithms

• edit-distance-vector

  4.8 0.0 exact-cover VS edit-distance-vector

  Calculate edit distances and edit scripts between vectors.

• sgd

  4.8 7.0 exact-cover VS sgd

  Stochastic gradient descent

• integer-logarithms

  4.8 3.6 exact-cover VS integer-logarithms

  Integer logarithms.

• binary-search

  4.6 0.0 exact-cover VS binary-search

  Binary and exponential searches

• TrieMap

  4.3 0.0 exact-cover VS TrieMap

  Automatic type inference of generalized tries with Template Haskell.

• primesieve

  4.3 1.9 exact-cover VS primesieve

  FFI bindings for the primesieve library.

• union-find-array

  4.3 0.0 exact-cover VS union-find-array

  union find data structure

• KMP

  4.3 0.7 exact-cover VS KMP

  Knuth–Morris–Pratt string searching algorithm

• DP

  4.1 0.0 exact-cover VS DP

  Pragmatic framework for dynamic programming

• infinite-search

  4.1 0.0 exact-cover VS infinite-search

  Exhaustively searchable infinite sets.

• graph-generators

  4.1 0.0 exact-cover VS graph-generators

  Functions for generating structured or random FGL graphs

• pathfinding

  3.8 0.0 exact-cover VS pathfinding

  pathfinding in grid and graphs

• jps

  3.8 0.0 exact-cover VS jps

  Jump point search for Haskell

• spacefill

  3.5 0.0 exact-cover VS spacefill

  Generators for space-filling curves.

• nonlinear-optimization-ad

  3.5 0.0 exact-cover VS nonlinear-optimization-ad

  Wrapper of nonlinear-optimization package for using with AD package

• edit-distance-linear

  3.1 7.1 exact-cover VS edit-distance-linear

  Efficient implementation of the Levenshtein edit distance in linear memory.

• GraphSCC

  3.1 0.0 exact-cover VS GraphSCC

  Tarjan's algorithm for computing the strongly connected components of a graph.

• epanet-haskell

  2.9 0.0 L2 exact-cover VS epanet-haskell

  Haskell binding for EPANET

• twentyseven

  2.9 0.0 exact-cover VS twentyseven

  Rubik's cube solver

• fibonacci

  2.9 0.0 exact-cover VS fibonacci

  Fast computation of Fibonacci numbers.

• pell

  2.5 0.0 exact-cover VS pell

  Package to solve the Generalized Pell Equation.

• dgim

  2.5 0.0 exact-cover VS dgim

  Implementation of DGIM algorithm

• learning-hmm

  2.5 0.0 exact-cover VS learning-hmm

  Yet another library for hidden Markov models

• stable-marriage

  2.5 0.0 exact-cover VS stable-marriage

  algorithms around stable marriage

• adp-multi

  2.1 0.0 exact-cover VS adp-multi

  ADP for multiple context-free languages

* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest. Visit our partner's website for more details.

Do you think we are missing an alternative of exact-cover or a related project?

Popular Comparisons

• fibonacci
  vs
  pell
• infinite-search
  vs
  incremental-sat-solver
• graphs
  vs
  ersatz
• union-find
  vs
  arithmoi
• arithmoi
  vs
  twentyseven

SaaSHub - Software Alternatives and Reviews View more from us