kd_tree VS crystalg

Compare kd_tree vs crystalg and see what are their differences.

kd_tree

Crystal implementation of "K-Dimensional Tree" and "N-Nearest Neighbors" (by geocrystal)
Algorithms and Data structures Crystal k-dimensional Data structures tree-structure
Source Code
Suggest alternative
Edit details

crystalg

Algorithm Library for Crystal (by tobyapi)
Algorithms and Data structures Crystal Algorithm
Source Code
Suggest alternative
Edit details
WorkOS
Our great sponsors
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • SaaSHub - Software Alternatives and Reviews
Our great sponsors
kd_tree crystalg
- -
16 37
- -
0.0 0.0
about 3 years ago about 3 years ago
Crystal Crystal
MIT License MIT 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.

kd_tree

Posts with mentions or reviews of kd_tree. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning kd_tree yet.
Tracking mentions began in Dec 2020.

crystalg

Posts with mentions or reviews of crystalg. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning crystalg yet.
Tracking mentions began in Dec 2020.

What are some alternatives?

When comparing kd_tree and crystalg you can also consider the following projects:

murmur3 - Crystal implementation of Murmur3 hash algorithm used by Cassandra

crystalline - A collection of containers & algorithms for the Crystal programming language

haversine - Crystal implementation of the Haversine formula to calculate distances between two points given their latitudes and longitudes

splay_tree_map.cr - 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.

graphlb - graphlb is a crystal library which contains all the graph Data-Structures and Algorithms implemented in crystal-lang.

radix - Radix Tree implementation for Crystal

multiset.cr - Multiset (bag) implementation in Crystal

s2_cells - maps latitude and longitude to S2 Cells https://s2geometry.io/

blurhash.cr - A pure Crystal implementation of BlurHash algorithm

edits.cr - Edit distance algorithms inc. Jaro, Damerau-Levenshtein, and Optimal Alignment

csuuid.cr - This is a small UUID library that implements a chronologically sortable UUID.

heap.cr - data structure heap for crystal-lang

kd_tree vs murmur3 crystalg vs crystalline kd_tree vs haversine crystalg vs splay_tree_map.cr kd_tree vs graphlb crystalg vs radix kd_tree vs multiset.cr crystalg vs s2_cells kd_tree vs blurhash.cr crystalg vs edits.cr kd_tree vs csuuid.cr crystalg vs heap.cr