Popularity
6.6
Stable
Activity
0.0
Stable
38
5
2
Programming language: Crystal
License: MIT License
Tags:
Algorithms And Data Structures
crystalg alternatives and similar shards
Based on the "Algorithms and Data structures" category.
Alternatively, view crystalg alternatives based on common mentions on social networks and blogs.
-
-
-
-
-
-
-
-
graphlb
graphlb is a crystal library which contains all the graph Data-Structures and Algorithms implemented in crystal-lang. -
-
-
text
A collection of phonetic algorithms for Crystal. Including; Porter-Stemmer, Soundex, Metaphone, Double Metaphone & White Similarity -
-
splay_tree_map
This is a Crystal implementation of a Splay Tree; which is a type of binary search tree that is semi-balanced and that tends to self-optimize so that the most accessed items are the fastest to retrieve. -
-
haversine
Crystal implementation of the Haversine formula to calculate distances between two points given their latitudes and longitudes -
-
-
-
-
-
-
-
-
SPAKE2+
a crystal lang implementation of SPAKE2+, a Password Authenticated Key Exchange (PAKE) protocol -
-
-
-
CodeRabbit: AI Code Reviews for Developers
Revolutionize your code reviews with AI. CodeRabbit offers PR summaries, code walkthroughs, 1-click suggestions, and AST-based analysis. Boost productivity and code quality across all major languages with each PR.
Promo
coderabbit.ai
Do you think we are missing an alternative of crystalg or a related project?
README
Crystalg
A generic algorithm library for crystal-lang.
Installation
Clone repository manually:
$ git clone https://github.com/TobiasGSmollett/crystalg && cd crystalg/
Or add this to your application's shard.yml:
dependencies:
crystalg:
github: TobiasGSmollett/crystalg
Usage
The fastest way to try it is by using Crystal Playground (crystal play):
require "./crystalg"
include Crystalg::Strings
input = "mississippi"
hash = RollingHash.new input
hash.count("issi") # => 2
Documentation
Development
crystal spec
To Do
- Graph
- Minimum-Cost Arborescence
- Strongly Connected Components
- Flow Alogorithm
- Minimum Cost Flow
- Data Structure
- Red Black Tree
- Link-Cut Tree
- String Algorithm
- Suffix Automaton
- Computational Geometry
- Closest Pair
- Segment Intersections
- Tangent to a Circle
- Common Tangent
- Intersection of a Circle and a Polygon
Contributing
- Fork it ( https://github.com/TobiasGSmollett/crystalg/fork )
- Create your feature branch (git checkout -b my-new-feature)
- Commit your changes (git commit -am 'Add some feature')
- Push to the branch (git push origin my-new-feature)
- Create a new Pull Request
Contributors
- TobiasGSmollett tobias - creator, maintainer