graphs alternatives and similar packages

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

• build

  9.5 0.0 graphs VS build

  Build Systems à la Carte

• arithmoi

  9.5 1.2 graphs VS arithmoi

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

Less time debugging, more time building

Scout APM allows you to find and fix performance issues with no hassle. Now with error monitoring and external services monitoring, Scout is a developer's best friend when it comes to application development.

Promo scoutapm.com



• toysolver

  9.3 6.2 graphs VS toysolver

  My sandbox for experimenting with solver algorithms.

• ersatz

  8.9 3.6 graphs VS ersatz

  A monad for interfacing with external SAT solvers

• iproute

  8.8 3.4 graphs VS iproute

  IP Routing Table in Haskell

• aeson-diff

  8.5 0.0 graphs VS aeson-diff

  Generate and apply diffs between JSON documents.

• funsat

  8.3 0.0 graphs VS funsat

  An efficient, embeddable DPLL SAT solver in Haskell

• primes

  8.1 0.0 graphs VS primes

  Prime Numbers for Haskell

• union-find

  8.0 0.0 graphs VS union-find

  Efficient union and equivalence testing of sets.

• presburger

  8.0 0.0 graphs VS presburger

  Decision procedures for Presburger arithmetic in Haskell

• HMM

  7.9 0.0 graphs VS HMM

  hidden markov models in haskell

• imj-animation

  7.6 6.7 graphs VS imj-animation

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

• text-metrics

  7.6 2.9 graphs VS text-metrics

  Calculate various string metrics efficiently in Haskell

• search-algorithms

  7.5 0.0 graphs VS search-algorithms

  Haskell library containing common graph search algorithms

• lca

  7.5 0.0 graphs VS lca

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

• ADPfusion

  7.3 0.0 graphs VS ADPfusion

  Efficient, high-level dynamic programming

• Adaptive

  6.9 0.0 graphs VS Adaptive

  Library for incremental computing.

• dtw

  6.8 0.0 graphs VS dtw

  Implementation of Dynamic Time Warping in Haskell

• edit-distance

  6.6 0.0 graphs VS edit-distance

  Edit distance library for Haskell
  

• integer-logarithms

  6.3 0.0 graphs VS integer-logarithms

  Integer logarithms, originally split from arithmoi package
  

• ListTree

  6.3 0.0 graphs VS ListTree

  A List monad transformer and related tools

• treeviz

  6.2 0.0 graphs VS treeviz

  Haskell library for visualizing algorithmic decomposition of computations.

• qchas

  6.0 0.0 graphs VS qchas

  A library for implementing Quantum Algorithms

• binary-search

  6.0 0.0 graphs VS binary-search

  Binary and exponential searches

• incremental-sat-solver

  6.0 0.0 graphs VS incremental-sat-solver

  Simple, Incremental SAT Solving as a Haskell Library

• cmaes

  5.5 0.0 L1 graphs VS cmaes

  CMA-ES wrapper in Haskell

• sgd

  5.5 0.0 graphs VS sgd

  Stochastic gradient descent Haskell library

• twentyseven

  5.4 0.0 graphs VS twentyseven

  Rubik's cube solver in Haskell

• DP

  5.1 0.0 graphs VS DP

  Holder for a bunch of semirings used in ChartParsing

• nonlinear-optimization-ad

  5.0 3.8 graphs VS nonlinear-optimization-ad

  Wrapper of nonlinear-optimization package for using with ad and backprop packages

• TrieMap

  4.9 0.0 graphs VS TrieMap

  Generalized tries for Haskell

• GraphSCC

  4.9 0.0 graphs VS GraphSCC

  Tarjan's algorithm for computing strongly connected components

• KMP

  4.7 0.0 graphs VS KMP

  Knuth–Morris–Pratt string searching algorithm

• infinite-search

  4.7 0.0 graphs VS infinite-search

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

• union-find-array

  4.6 0.7 graphs VS union-find-array

  ST based union find data structure
  

• jps

  4.2 0.0 graphs VS jps

  :point_right: jump point search for Haskell

• primesieve

  4.2 0.3 graphs VS primesieve

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

• spacefill

  4.0 0.0 graphs VS spacefill

  Space-filling curves

• adp-multi

  3.9 0.0 graphs VS adp-multi

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

• primal

  3.9 0.0 graphs VS primal

  Primitive World of Haskell

• pathfinding

  3.7 0.0 graphs VS pathfinding

  Haskell pathfinding library

• edit-distance-vector

  3.7 0.0 graphs VS edit-distance-vector

  Calculate edit scripts and distances between Vectors.

• graph-generators

  3.7 0.0 graphs VS graph-generators

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

• edit-distance-linear

  3.3 0.0 graphs VS edit-distance-linear

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

• primes-type

  3.1 0.0 graphs VS primes-type

  Type-safe prime numbers.

• stable-marriage

  3.0 0.0 graphs VS stable-marriage

  library around stable marriage algorithms

• bordacount

  2.8 0.0 graphs VS bordacount

  Haskell implementation of the Borda count election method

• epanet-haskell

  2.4 0.0 L2 graphs VS epanet-haskell

  Call the EPANET toolkit via Haskell's Foreign Function Interface

• longshot

  2.4 0.0 graphs VS longshot

  Fast Brute-force search using parallelism

• learning-hmm

  2.3 0.0 graphs VS learning-hmm

  Yet another Haskell library for hidden Markov models

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

Clean code begins in your IDE with SonarLint sponsored www.sonarlint.org

Popular Comparisons

• graphs
  vs
  ersatz
• graphs
  vs
  arithmoi
• graphs
  vs
  graph-generators
• graphs
  vs
  lca
• graphs
  vs
  twentyseven

SaaSHub - Software Alternatives and Reviews sponsored www.saashub.com