algorithms around stable marriage

stable-marriage alternatives and similar packages

Based on the "Algorithms" category

• build

  9.5 5.3 stable-marriage VS build

  Build systems a la carte

• arithmoi

  9.4 8.7 stable-marriage VS arithmoi

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

• toysolver

  9.3 7.1 stable-marriage VS toysolver

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

• ersatz

  9.1 5.3 stable-marriage VS ersatz

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

• iproute

  8.9 4.5 stable-marriage VS iproute

  IP Routing Table

• graphs

  8.5 2.5 stable-marriage VS graphs

  A simple monadic graph library

• HMM

  8.2 0.0 stable-marriage VS HMM

  A hidden markov model library

• primes

  8.2 0.0 stable-marriage VS primes

  Efficient, purely functional generation of prime numbers

• funsat

  8.1 0.0 stable-marriage VS funsat

  A modern DPLL-style SAT solver

• presburger

  7.9 1.1 stable-marriage VS presburger

  A decision procedure for quantifier-free linear arithmetic.

• aeson-diff

  7.8 2.4 stable-marriage VS aeson-diff

  Extract and apply patches to JSON documents.

• union-find

  7.8 0.0 stable-marriage VS union-find

  Efficient union and equivalence testing of sets.

• imj-animation

  7.7 0.0 stable-marriage VS imj-animation

  Animation Framework

• text-metrics

  7.6 4.6 stable-marriage VS text-metrics

  Calculate various string metrics efficiently

• lca

  7.4 2.9 stable-marriage VS lca

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

• Adaptive

  7.1 0.0 stable-marriage VS Adaptive

  Library for incremental computing.

• search-algorithms

  7.1 3.0 stable-marriage VS search-algorithms

  Common graph search algorithms

• dtw

  7.0 0.0 stable-marriage VS dtw

  (Fast) Dynamic Time Warping

• treeviz

  6.5 0.0 stable-marriage VS treeviz

  Visualization of computation decomposition trees.

• edit-distance

  6.4 2.5 stable-marriage VS edit-distance

  Levenshtein and restricted Damerau-Levenshtein edit distances

• qchas

  6.2 0.3 stable-marriage VS qchas

  A library for implementing Quantum Algorithms

• ADPfusion

  6.2 0.0 stable-marriage VS ADPfusion

  Efficient, high-level dynamic programming.

• incremental-sat-solver

  6.1 0.0 stable-marriage VS incremental-sat-solver

  Simple, Incremental SAT Solving as a Library

• integer-logarithms

  5.4 2.2 stable-marriage VS integer-logarithms

  Integer logarithms.

• ListTree

  5.3 0.0 stable-marriage VS ListTree

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

• cmaes

  5.0 0.0 L1 stable-marriage VS cmaes

  CMA-ES wrapper in Haskell

• nonlinear-optimization-ad

  4.8 6.4 stable-marriage VS nonlinear-optimization-ad

  Wrapper of nonlinear-optimization package for using with AD package

• sgd

  4.8 7.0 stable-marriage VS sgd

  Stochastic gradient descent

• binary-search

  4.6 0.0 stable-marriage VS binary-search

  Binary and exponential searches

• TrieMap

  4.6 0.0 stable-marriage VS TrieMap

  Automatic type inference of generalized tries with Template Haskell.

• edit-distance-vector

  4.4 0.0 stable-marriage VS edit-distance-vector

  Calculate edit distances and edit scripts between vectors.

• union-find-array

  4.3 0.0 stable-marriage VS union-find-array

  union find data structure

• KMP

  4.3 0.7 stable-marriage VS KMP

  Knuth–Morris–Pratt string searching algorithm

• primesieve

  4.3 1.9 stable-marriage VS primesieve

  FFI bindings for the primesieve library.

• DP

  4.1 0.0 stable-marriage VS DP

  Pragmatic framework for dynamic programming

• graph-generators

  4.1 0.0 stable-marriage VS graph-generators

  Functions for generating structured or random FGL graphs

• infinite-search

  4.1 0.0 stable-marriage VS infinite-search

  Exhaustively searchable infinite sets.

• pathfinding

  4.0 0.0 stable-marriage VS pathfinding

  pathfinding in grid and graphs

• jps

  4.0 0.0 stable-marriage VS jps

  Jump point search for Haskell

• spacefill

  3.8 0.0 stable-marriage VS spacefill

  Generators for space-filling curves.

• GraphSCC

  3.1 0.0 stable-marriage VS GraphSCC

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

• edit-distance-linear

  3.1 6.7 stable-marriage VS edit-distance-linear

  Efficient implementation of the Levenshtein edit distance in linear memory.

• fibonacci

  2.9 0.0 stable-marriage VS fibonacci

  Fast computation of Fibonacci numbers.

• twentyseven

  2.9 0.0 stable-marriage VS twentyseven

  Rubik's cube solver

• epanet-haskell

  2.9 0.0 L2 stable-marriage VS epanet-haskell

  Haskell binding for EPANET

• dgim

  2.5 0.0 stable-marriage VS dgim

  Implementation of DGIM algorithm

• learning-hmm

  2.5 0.0 stable-marriage VS learning-hmm

  Yet another library for hidden Markov models

• primes-type

  2.4 0.0 stable-marriage VS primes-type

  Type-safe prime numbers.

• bordacount

  2.4 0.0 stable-marriage VS bordacount

  Implementation of the Borda count election method.

• adp-multi

  2.1 0.0 stable-marriage 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 stable-marriage or a related project?

Add another 'Algorithms' Package

Popular Comparisons

• stable-marriage
  vs
  arithmoi
• stable-marriage
  vs
  lca
• stable-marriage
  vs
  twentyseven
• stable-marriage
  vs
  graph-generators
• stable-marriage
  vs
  ADPfusionSet