| kmp-dfa | iproute | |
|---|---|---|
| - | 1 | |
| 0 | 46 | |
| - | - | |
| 0.0 | 4.5 | |
| almost 7 years ago | 3 months ago | |
| Haskell | Haskell | |
| BSD 3-clause "New" or "Revised" License | BSD 3-clause "New" or "Revised" License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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.
kmp-dfa
Posts with mentions or reviews of kmp-dfa.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning kmp-dfa yet.
Tracking mentions began in Dec 2020.
iproute
Posts with mentions or reviews of iproute.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-11-13.
What are some alternatives?
When comparing kmp-dfa and iproute you can also consider the following projects:
arithmoi - Number theory: primes, arithmetic functions, modular computations, special sequences
binary-search - Binary and exponential searches
toysolver - My sandbox for experimenting with solver algorithms.
graph-generators - A Haskell library for creating random Data.Graph instances using several pop
primes - Prime Numbers for Haskell
lca - Improves the known complexity of online lowest common ancestor search to O(log h) persistently, and without preprocessing
build - Build Systems à la Carte
twentyseven - Rubik's cube solver in Haskell
aeson-diff - Generate and apply diffs between JSON documents.