Visualization of computation decomposition trees.

treeviz alternatives and similar packages

Based on the "Algorithms" category

• build

  9.5 2.7 treeviz VS build

  Build systems a la carte

• arithmoi

  9.5 8.4 treeviz VS arithmoi

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

• toysolver

  9.3 7.7 treeviz VS toysolver

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

Scout APM: Application Performance Monitoring

Scout gets developers back to coding faster. An intuitive UI streamlines real-time performance insight so you can quickly pinpoint & resolve issues before the customer ever sees them. Start your free trial today!

Promoted scoutapm.com



• ersatz

  9.0 3.8 treeviz VS ersatz

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

• iproute

  8.8 4.4 treeviz VS iproute

  IP Routing Table

• graphs

  8.4 2.5 treeviz VS graphs

  A simple monadic graph library

• aeson-diff

  8.3 2.4 treeviz VS aeson-diff

  Extract and apply patches to JSON documents.

• primes

  8.2 0.0 treeviz VS primes

  Efficient, purely functional generation of prime numbers

• funsat

  8.2 0.0 treeviz VS funsat

  A modern DPLL-style SAT solver

• HMM

  8.1 0.0 treeviz VS HMM

  A hidden markov model library

• presburger

  8.0 1.9 treeviz VS presburger

  A decision procedure for quantifier-free linear arithmetic.

• union-find

  7.9 0.0 treeviz VS union-find

  Efficient union and equivalence testing of sets.

• text-metrics

  7.6 4.8 treeviz VS text-metrics

  Calculate various string metrics efficiently

• imj-animation

  7.6 6.8 treeviz VS imj-animation

  Animation Framework

• lca

  7.4 2.5 treeviz VS lca

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

• Adaptive

  7.3 0.0 treeviz VS Adaptive

  Library for incremental computing.

• search-algorithms

  7.2 1.3 treeviz VS search-algorithms

  Common graph search algorithms

• dtw

  6.9 0.0 treeviz VS dtw

  (Fast) Dynamic Time Warping

• ADPfusion

  6.7 6.9 treeviz VS ADPfusion

  Efficient, high-level dynamic programming.

• incremental-sat-solver

  6.3 0.0 treeviz VS incremental-sat-solver

  Simple, Incremental SAT Solving as a Library

• qchas

  6.3 0.0 treeviz VS qchas

  A library for implementing Quantum Algorithms

• edit-distance

  6.3 3.0 treeviz VS edit-distance

  Levenshtein and restricted Damerau-Levenshtein edit distances

• ListTree

  5.9 0.0 treeviz VS ListTree

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

• cmaes

  5.8 0.0 L1 treeviz VS cmaes

  CMA-ES wrapper in Haskell

• integer-logarithms

  5.2 2.1 treeviz VS integer-logarithms

  Integer logarithms.

• primesieve

  5.2 1.4 treeviz VS primesieve

  FFI bindings for the primesieve library.

• twentyseven

  5.2 0.0 treeviz VS twentyseven

  Rubik's cube solver

• binary-search

  5.2 0.0 treeviz VS binary-search

  Binary and exponential searches

• DP

  4.9 0.0 treeviz VS DP

  Pragmatic framework for dynamic programming

• nonlinear-optimization-ad

  4.6 5.4 treeviz VS nonlinear-optimization-ad

  Wrapper of nonlinear-optimization package for using with AD package

• sgd

  4.6 0.3 treeviz VS sgd

  Stochastic gradient descent

• GraphSCC

  4.6 0.0 treeviz VS GraphSCC

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

• union-find-array

  4.4 0.0 treeviz VS union-find-array

  union find data structure

• TrieMap

  4.4 0.0 treeviz VS TrieMap

  Automatic type inference of generalized tries with Template Haskell.

• KMP

  4.4 0.0 treeviz VS KMP

  Knuth–Morris–Pratt string searching algorithm

• infinite-search

  4.4 0.0 treeviz VS infinite-search

  Exhaustively searchable infinite sets.

• edit-distance-vector

  4.1 0.0 treeviz VS edit-distance-vector

  Calculate edit distances and edit scripts between vectors.

• graph-generators

  4.1 0.0 treeviz VS graph-generators

  Functions for generating structured or random FGL graphs

• jps

  3.8 0.0 treeviz VS jps

  Jump point search for Haskell

• pathfinding

  3.8 0.0 treeviz VS pathfinding

  pathfinding in grid and graphs

• edit-distance-linear

  3.8 4.4 treeviz VS edit-distance-linear

  Efficient implementation of the Levenshtein edit distance in linear memory.

• stable-marriage

  3.6 3.5 treeviz VS stable-marriage

  algorithms around stable marriage

• adp-multi

  3.6 0.0 treeviz VS adp-multi

  ADP for multiple context-free languages

• spacefill

  3.6 0.0 treeviz VS spacefill

  Generators for space-filling curves.

• primal

  3.3 8.7 treeviz VS primal

  Primeval world of Haskell.

• epanet-haskell

  2.9 0.0 L2 treeviz VS epanet-haskell

  Haskell binding for EPANET

• dgim

  2.6 0.0 treeviz VS dgim

  Implementation of DGIM algorithm

• learning-hmm

  2.6 0.0 treeviz VS learning-hmm

  Yet another library for hidden Markov models

• primes-type

  2.3 0.0 treeviz VS primes-type

  Type-safe prime numbers.

• bordacount

  2.3 0.0 treeviz VS bordacount

  Implementation of the Borda count election method.

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

Popular Comparisons

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

SaaSHub - Software Alternatives and Reviews More from our partner