incremental-sat-solver
graph-generators
Our great sponsors
incremental-sat-solver | graph-generators | |
---|---|---|
- | - | |
14 | 3 | |
- | - | |
0.0 | 0.0 | |
over 7 years ago | almost 6 years ago | |
Haskell | Haskell | |
BSD 3-clause "New" or "Revised" License | Apache License 2.0 |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
incremental-sat-solver
We haven't tracked posts mentioning incremental-sat-solver yet.
Tracking mentions began in Dec 2020.
graph-generators
We haven't tracked posts mentioning graph-generators yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
primes - Prime Numbers for Haskell
union-find - Efficient union and equivalence testing of sets.
arithmoi - Number theory: primes, arithmetic functions, modular computations, special sequences
spacefill - Space-filling curves
pathfinding - Haskell pathfinding library
twentyseven - Rubik's cube solver in Haskell
KMP - Knuth–Morris–Pratt string searching algorithm
ersatz - A monad for interfacing with external SAT solvers
infinite-search - An implementation of Martin Escardo's exhaustively searchable sets in Haskell.
graphs - a monadic graph library
funsat - An efficient, embeddable DPLL SAT solver in Haskell
primes-type - Type-safe prime numbers.