ListTree alternatives and similar packages

Based on the "Algorithms" category.
Alternatively, view ListTree alternatives based on common mentions on social networks and blogs.

• build

  9.6 3.1 ListTree VS build

  Build Systems à la Carte

• arithmoi

  9.5 4.9 ListTree VS arithmoi

  Number theory: primes, arithmetic functions, modular computations, special sequences

CodeRabbit: AI Code Reviews for Developers

Revolutionize your code reviews with AI. CodeRabbit offers PR summaries, code walkthroughs, 1-click suggestions, and AST-based analysis. Boost productivity and code quality across all major languages with each PR.

Promo coderabbit.ai



• toysolver

  9.3 7.6 ListTree VS toysolver

  My sandbox for experimenting with solver algorithms.

• ersatz

  8.9 5.3 ListTree VS ersatz

  A monad for interfacing with external SAT solvers

• iproute

  8.8 5.7 ListTree VS iproute

  IP Routing Table in Haskell

• aeson-diff

  8.4 0.0 ListTree VS aeson-diff

  Generate and apply diffs between JSON documents.

• funsat

  8.2 0.0 ListTree VS funsat

  An efficient, embeddable DPLL SAT solver in Haskell

• graphs

  8.2 3.8 ListTree VS graphs

  a monadic graph library

• primes

  8.1 0.0 ListTree VS primes

  Prime Numbers for Haskell

• search-algorithms

  8.0 3.2 ListTree VS search-algorithms

  Haskell library containing common graph search algorithms

• imj-animation

  7.9 0.0 ListTree VS imj-animation

  Monorepo for a multi-player game engine, and game examples

• union-find

  7.9 0.0 ListTree VS union-find

  DISCONTINUED. Efficient union and equivalence testing of sets.

• HMM

  7.9 0.0 ListTree VS HMM

  hidden markov models in haskell

• presburger

  7.7 0.0 ListTree VS presburger

  Decision procedures for Presburger arithmetic in Haskell

• text-metrics

  7.7 4.5 ListTree VS text-metrics

  Calculate various string metrics efficiently in Haskell

• lca

  7.4 0.0 ListTree VS lca

  Improves the known complexity of online lowest common ancestor search to O(log h) persistently, and without preprocessing

• ADPfusion

  7.4 5.1 ListTree VS ADPfusion

  Efficient, high-level dynamic programming

• dtw

  6.7 0.0 ListTree VS dtw

  Implementation of Dynamic Time Warping in Haskell

• Adaptive

  6.7 0.0 ListTree VS Adaptive

  Library for incremental computing.

• treeviz

  6.3 0.0 ListTree VS treeviz

  Haskell library for visualizing algorithmic decomposition of computations.

• edit-distance

  6.3 0.0 ListTree VS edit-distance

  Edit distance library for Haskell
  

• incremental-sat-solver

  6.2 0.0 ListTree VS incremental-sat-solver

  Simple, Incremental SAT Solving as a Haskell Library

• qchas

  6.1 0.0 ListTree VS qchas

  DISCONTINUED. A library for implementing Quantum Algorithms

• integer-logarithms

  6.0 4.9 ListTree VS integer-logarithms

  Integer logarithms, originally split from arithmoi package
  

• binary-search

  5.7 0.0 ListTree VS binary-search

  Binary and exponential searches

• sgd

  5.7 0.0 ListTree VS sgd

  Stochastic gradient descent Haskell library

• primal

  5.5 0.0 ListTree VS primal

  Primitive World of Haskell

• cmaes

  5.4 0.0 L1 ListTree VS cmaes

  CMA-ES wrapper in Haskell

• twentyseven

  5.4 0.0 ListTree VS twentyseven

  Rubik's cube solver in Haskell

• primesieve

  4.9 5.3 ListTree VS primesieve

  A collection of packages related to math, algorithms and science, in Haskell.

• DP

  4.9 0.0 ListTree VS DP

  Holder for a bunch of semirings used in ChartParsing

• GraphSCC

  4.8 0.0 ListTree VS GraphSCC

  Tarjan's algorithm for computing strongly connected components

• union-find-array

  4.7 3.2 ListTree VS union-find-array

  ST based union find data structure
  

• infinite-search

  4.6 0.0 ListTree VS infinite-search

  An implementation of Martin Escardo's exhaustively searchable sets in Haskell.

• graph-generators

  4.5 0.0 ListTree VS graph-generators

  A Haskell library for creating random Data.Graph instances using several pop

• nonlinear-optimization-ad

  4.3 7.3 ListTree VS nonlinear-optimization-ad

  Several Haskell packages for numerical optimizations.

• adp-multi

  4.3 0.0 ListTree VS adp-multi

  Prototype of ADP for MCFL (multiple context-free languages)
  

• TrieMap

  4.1 0.0 ListTree VS TrieMap

  Generalized tries for Haskell

• jps

  4.1 0.0 ListTree VS jps

  :point_right: jump point search for Haskell

• spacefill

  3.8 0.0 ListTree VS spacefill

  Space-filling curves

• KMP

  3.8 0.0 ListTree VS KMP

  Knuth–Morris–Pratt string searching algorithm

• edit-distance-vector

  3.8 0.0 ListTree VS edit-distance-vector

  Calculate edit scripts and distances between Vectors.

• pathfinding

  3.7 0.0 ListTree VS pathfinding

  DISCONTINUED. Haskell pathfinding library

• edit-distance-linear

  3.3 0.0 ListTree VS edit-distance-linear

  Levenshtein edit distance in linear memory (also turns out to be faster than C++)

• stable-marriage

  3.1 1.1 ListTree VS stable-marriage

  library around stable marriage algorithms

• dgim

  3.1 0.0 ListTree VS dgim

  :chart_with_upwards_trend: Implementation of the DGIM algorithm in Haskell.

• integer-roots

  3.1 4.0 ListTree VS integer-roots

  Integer roots and perfect powers of arbitrary precision

• fibonacci

  3.1 0.0 ListTree VS fibonacci

  Fast computation of Fibonacci numbers in Haskell

• pell

  2.8 0.0 ListTree VS pell

  Haskell Package to solve the Generalized Pell Equation

• MIP

  2.8 5.8 ListTree VS MIP

  Libraries for reading/writing MIP problem files, invoking external MIP solvers, etc. in Haskell

* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest.

Do you think we are missing an alternative of ListTree or a related project?

SaaSHub - Software Alternatives and Reviews

featured www.saashub.com

Popular Comparisons

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