An implementation of the schulze method election system
Schulze method JavaScript implementation.
TypeScript library implementing various Condorcet voting algorithms
Ranked pairs voting (Tideman) with a fixed four-level deterministic tiebreaker cascade: margin, winning votes, beatpath, lexicographic.
Open Refine reconciliation service for PeriodO data
A voting profile for a fair voting system
KaHIP-style flow-based nested-dissection fill-reducing ordering (Sanders & Schulz 2011; data reduction per Ost, Schulz & Strash 2021). Pure Rust, clean-room, standalone. Implements the FERAL ordering-crate contract.
Levenshtein/Universal Automata for approximate string matching using various dictionary backends
Serde-compatible TOON v3.0 encoder/decoder
tallystick is a rust library for talling votes
Idiomatic Rust wrappers for the NVIDIA CUDA stack (Driver API, Runtime API, NVRTC, cuBLAS, cuDNN, NCCL, NVML, ...). Umbrella crate.
Optimizers and learning rate schedulers for ferrotorch
An implementation of the FuzzyDBSCAN algorithm
Rust wrapper around KaMinPar which is a shared-memory parallel tool to heuristically solve the graph partitioning problem.
Creates Levenshtein Automata in an efficient manner.
Rust bindings for the Listen Notes Podcast API
Collection of preferential voting methods
The Schulze Method, for ruby
This gem is a Ruby implementation of the Schulze voting method (with help of the Floyd-Warshall algorithm), a type of the Condorcet voting methods.
This gem is a Ruby implementation of the Schulze voting method (using Floyd–Warshall algorithm), a type of the Condorcet voting methods.
Schulze (Condorcet) voting calculation.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.