dgim
:chart_with_upwards_trend: Implementation of the DGIM algorithm in Haskell. (by musically-ut)
bordacount
Haskell implementation of the Borda count election method (by hverr)
dgim | bordacount | |
---|---|---|
- | - | |
5 | 1 | |
- | - | |
0.0 | 0.0 | |
about 9 years ago | over 6 years ago | |
Haskell | Haskell | |
MIT 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.
dgim
Posts with mentions or reviews of dgim.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning dgim yet.
Tracking mentions began in Dec 2020.
bordacount
Posts with mentions or reviews of bordacount.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning bordacount yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
When comparing dgim and bordacount you can also consider the following projects:
nonlinear-optimization-ad - Several Haskell packages for numerical optimizations.
lca - Improves the known complexity of online lowest common ancestor search to O(log h) persistently, and without preprocessing
graph-generators - A Haskell library for creating random Data.Graph instances using several pop
sgd - Stochastic gradient descent Haskell library
spacefill - Space-filling curves
qchas
twentyseven - Rubik's cube solver in Haskell
ADPfusion - Efficient, high-level dynamic programming
pell - Haskell Package to solve the Generalized Pell Equation