How this analysis was created: This summary and feature list were written by an AI model that read the project's README and public documentation pages. Each feature links to the documentation it came from; stars, license and language come straight from the GitHub API. The model does not read the source code, and the analysis is refreshed when the project is re-analysed. Learn more on our About page.
Combinatorial operations for Go
The main features of bobg/combo are: Data Structures.
Open-source alternatives to bobg/combo include: xtaci/algorithms — This is a collection of classical algorithms and data structures implemented as a header-only C++ library. It provides… adrianbrad/queue — ⏪️ Go package providing multiple queue implementations. Developed in a thread-safe generic way. agext/levenshtein — Levenshtein distance and similarity metrics with customizable edit costs and Winkler-like bonus for common prefix. agnivade/levenshtein — Go implementation to calculate Levenshtein Distance. aio-arch/graphlib — Topological sort lib,Sorting and pruning of DAG graphs. accelerationnet/access — A common lisp library to unify access to common dictionary-like data-structures.
This is a collection of classical algorithms and data structures implemented as a header-only C++ library. It provides a suite of tools for general algorithm implementation, including data structure management, graph theory analysis, and string processing. The library is distinguished by its specialized toolkits for cryptographic hashing and encoding, featuring implementations of MD5, SHA-1, and Base64. It also includes advanced capabilities for high-performance string processing via suffix trees and arrays, as well as computational number theory for primality testing and arbitrary-precision
⏪️ Go package providing multiple queue implementations. Developed in a thread-safe generic way.
Levenshtein distance and similarity metrics with customizable edit costs and Winkler-like bonus for common prefix.
A common lisp library to unify access to common dictionary-like data-structures