GraphSCC alternatives and similar packages

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

• build

  9.6 3.1 GraphSCC VS build

  Build Systems à la Carte

• arithmoi

  9.5 4.9 GraphSCC VS arithmoi

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

SaaSHub - Software Alternatives and Reviews

SaaSHub helps you find the best software and product alternatives

Promo www.saashub.com



• toysolver

  9.3 7.6 GraphSCC VS toysolver

  My sandbox for experimenting with solver algorithms.

• ersatz

  8.9 5.3 GraphSCC VS ersatz

  A monad for interfacing with external SAT solvers

• iproute

  8.8 5.7 GraphSCC VS iproute

  IP Routing Table in Haskell

• aeson-diff

  8.4 0.0 GraphSCC VS aeson-diff

  Generate and apply diffs between JSON documents.

• graphs

  8.2 3.8 GraphSCC VS graphs

  a monadic graph library

• funsat

  8.2 0.0 GraphSCC VS funsat

  An efficient, embeddable DPLL SAT solver in Haskell

• primes

  8.1 0.0 GraphSCC VS primes

  Prime Numbers for Haskell

• search-algorithms

  8.0 3.2 GraphSCC VS search-algorithms

  Haskell library containing common graph search algorithms

• HMM

  7.9 0.0 GraphSCC VS HMM

  hidden markov models in haskell

• union-find

  7.9 0.0 GraphSCC VS union-find

  DISCONTINUED. Efficient union and equivalence testing of sets.

• imj-animation

  7.9 0.0 GraphSCC VS imj-animation

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

• presburger

  7.7 0.0 GraphSCC VS presburger

  Decision procedures for Presburger arithmetic in Haskell

• text-metrics

  7.7 4.5 GraphSCC VS text-metrics

  Calculate various string metrics efficiently in Haskell

• lca

  7.4 0.0 GraphSCC 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 GraphSCC VS ADPfusion

  Efficient, high-level dynamic programming

• Adaptive

  6.7 0.0 GraphSCC VS Adaptive

  Library for incremental computing.

• dtw

  6.7 0.0 GraphSCC VS dtw

  Implementation of Dynamic Time Warping in Haskell

• edit-distance

  6.3 0.0 GraphSCC VS edit-distance

  Edit distance library for Haskell
  

• treeviz

  6.3 0.0 GraphSCC VS treeviz

  Haskell library for visualizing algorithmic decomposition of computations.

• incremental-sat-solver

  6.2 0.0 GraphSCC VS incremental-sat-solver

  Simple, Incremental SAT Solving as a Haskell Library

• ListTree

  6.2 0.0 GraphSCC VS ListTree

  A List monad transformer and related tools

• qchas

  6.1 0.0 GraphSCC VS qchas

  DISCONTINUED. A library for implementing Quantum Algorithms

• integer-logarithms

  6.0 4.9 GraphSCC VS integer-logarithms

  Integer logarithms, originally split from arithmoi package
  

• binary-search

  5.7 0.0 GraphSCC VS binary-search

  Binary and exponential searches

• sgd

  5.7 0.0 GraphSCC VS sgd

  Stochastic gradient descent Haskell library

• primal

  5.5 0.0 GraphSCC VS primal

  Primitive World of Haskell

• cmaes

  5.4 0.0 L1 GraphSCC VS cmaes

  CMA-ES wrapper in Haskell

• twentyseven

  5.4 0.0 GraphSCC VS twentyseven

  Rubik's cube solver in Haskell

• DP

  4.9 0.0 GraphSCC VS DP

  Holder for a bunch of semirings used in ChartParsing

• primesieve

  4.9 5.3 GraphSCC VS primesieve

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

• union-find-array

  4.7 3.2 GraphSCC VS union-find-array

  ST based union find data structure
  

• infinite-search

  4.6 0.0 GraphSCC VS infinite-search

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

• graph-generators

  4.5 0.0 GraphSCC VS graph-generators

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

• adp-multi

  4.3 0.0 GraphSCC VS adp-multi

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

• nonlinear-optimization-ad

  4.3 7.3 GraphSCC VS nonlinear-optimization-ad

  Several Haskell packages for numerical optimizations.

• jps

  4.1 0.0 GraphSCC VS jps

  :point_right: jump point search for Haskell

• TrieMap

  4.1 0.0 GraphSCC VS TrieMap

  Generalized tries for Haskell

• KMP

  3.8 0.0 GraphSCC VS KMP

  Knuth–Morris–Pratt string searching algorithm

• spacefill

  3.8 0.0 GraphSCC VS spacefill

  Space-filling curves

• edit-distance-vector

  3.8 0.0 GraphSCC VS edit-distance-vector

  Calculate edit scripts and distances between Vectors.

• pathfinding

  3.7 0.0 GraphSCC VS pathfinding

  DISCONTINUED. Haskell pathfinding library

• edit-distance-linear

  3.3 0.0 GraphSCC VS edit-distance-linear

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

• stable-marriage

  3.1 1.1 GraphSCC VS stable-marriage

  library around stable marriage algorithms

• dgim

  3.1 0.0 GraphSCC VS dgim

  :chart_with_upwards_trend: Implementation of the DGIM algorithm in Haskell.

• integer-roots

  3.1 4.0 GraphSCC VS integer-roots

  Integer roots and perfect powers of arbitrary precision

• fibonacci

  3.1 0.0 GraphSCC VS fibonacci

  Fast computation of Fibonacci numbers in Haskell

• pell

  2.8 0.0 GraphSCC VS pell

  Haskell Package to solve the Generalized Pell Equation

• MIP

  2.8 5.8 GraphSCC 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 GraphSCC or a related project?

Popular Comparisons

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