Implementation of DGIM algorithm

dgim alternatives and similar packages

Based on the "Algorithms" category

• arithmoi

  9.4 8.6 dgim VS arithmoi

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

• build

  9.4 7.9 dgim VS build

  Build systems a la carte

• toysolver

  9.1 7.8 dgim VS toysolver

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

• ersatz

  9.1 5.5 dgim VS ersatz

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

• iproute

  8.8 3.3 dgim VS iproute

  IP Routing Table

• primes

  8.3 0.0 dgim VS primes

  Efficient, purely functional generation of prime numbers

• graphs

  8.2 3.8 dgim VS graphs

  A simple monadic graph library

• funsat

  8.1 0.0 dgim VS funsat

  A modern DPLL-style SAT solver

• HMM

  7.9 0.0 dgim VS HMM

  A hidden markov model library

• aeson-diff

  7.8 2.4 dgim VS aeson-diff

  Extract and apply patches to JSON documents.

• union-find

  7.8 0.0 dgim VS union-find

  Efficient union and equivalence testing of sets.

• imj-animation

  7.6 0.4 dgim VS imj-animation

  Animation Framework

• presburger

  7.4 0.4 dgim VS presburger

  A decision procedure for quantifier-free linear arithmetic.

• text-metrics

  7.2 5.1 dgim VS text-metrics

  Calculate various string metrics efficiently

• Adaptive

  7.1 0.0 dgim VS Adaptive

  Library for incremental computing.

• edit-distance

  7.0 2.7 dgim VS edit-distance

  Levenshtein and restricted Damerau-Levenshtein edit distances

• lca

  6.8 3.8 dgim VS lca

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

• dtw

  6.5 0.0 dgim VS dtw

  (Fast) Dynamic Time Warping

• treeviz

  6.3 0.0 dgim VS treeviz

  Visualization of computation decomposition trees.

• qchas

  6.2 0.3 dgim VS qchas

  A library for implementing Quantum Algorithms

• ADPfusion

  6.2 0.0 dgim VS ADPfusion

  Efficient, high-level dynamic programming.

• incremental-sat-solver

  6.1 0.0 dgim VS incremental-sat-solver

  Simple, Incremental SAT Solving as a Library

• ListTree

  5.3 0.0 dgim VS ListTree

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

• cmaes

  5.0 0.0 L1 dgim VS cmaes

  CMA-ES wrapper in Haskell

• search-algorithms

  5.0 0.0 dgim VS search-algorithms

  Common graph search algorithms

• integer-logarithms

  4.8 3.6 dgim VS integer-logarithms

  Integer logarithms.

• sgd

  4.8 7.0 dgim VS sgd

  Stochastic gradient descent

• edit-distance-vector

  4.8 0.0 dgim VS edit-distance-vector

  Calculate edit distances and edit scripts between vectors.

• binary-search

  4.6 0.0 dgim VS binary-search

  Binary and exponential searches

• TrieMap

  4.3 0.0 dgim VS TrieMap

  Automatic type inference of generalized tries with Template Haskell.

• primesieve

  4.3 1.9 dgim VS primesieve

  FFI bindings for the primesieve library.

• union-find-array

  4.3 0.0 dgim VS union-find-array

  union find data structure

• KMP

  4.3 0.7 dgim VS KMP

  Knuth–Morris–Pratt string searching algorithm

• infinite-search

  4.1 0.0 dgim VS infinite-search

  Exhaustively searchable infinite sets.

• DP

  4.1 0.0 dgim VS DP

  Pragmatic framework for dynamic programming

• graph-generators

  4.1 0.0 dgim VS graph-generators

  Functions for generating structured or random FGL graphs

• jps

  3.8 0.0 dgim VS jps

  Jump point search for Haskell

• pathfinding

  3.8 0.0 dgim VS pathfinding

  pathfinding in grid and graphs

• spacefill

  3.5 0.0 dgim VS spacefill

  Generators for space-filling curves.

• nonlinear-optimization-ad

  3.5 0.0 dgim VS nonlinear-optimization-ad

  Wrapper of nonlinear-optimization package for using with AD package

• edit-distance-linear

  3.1 7.1 dgim VS edit-distance-linear

  Efficient implementation of the Levenshtein edit distance in linear memory.

• GraphSCC

  3.1 0.0 dgim VS GraphSCC

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

• fibonacci

  2.9 0.0 dgim VS fibonacci

  Fast computation of Fibonacci numbers.

• twentyseven

  2.9 0.0 dgim VS twentyseven

  Rubik's cube solver

• epanet-haskell

  2.9 0.0 L2 dgim VS epanet-haskell

  Haskell binding for EPANET

• learning-hmm

  2.5 0.0 dgim VS learning-hmm

  Yet another library for hidden Markov models

• stable-marriage

  2.5 0.0 dgim VS stable-marriage

  algorithms around stable marriage

• pell

  2.5 0.0 dgim VS pell

  Package to solve the Generalized Pell Equation.

• adp-multi

  2.1 0.0 dgim VS adp-multi

  ADP for multiple context-free languages

• ADPfusionSet

  1.1 0.0 dgim VS ADPfusionSet

  Dynamic programming for Set data structures.

* 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 dgim or a related project?

Popular Comparisons

• dgim
  vs
  graph-generators
• dgim
  vs
  arithmoi
• dgim
  vs
  ADPfusionSet
• dgim
  vs
  twentyseven
• dgim
  vs
  lca

SaaSHub - Software Alternatives and Reviews View more from us