jps alternatives and similar packages
Based on the "Algorithms" category.
Alternatively, view jps alternatives based on common mentions on social networks and blogs.
-
lca
Improves the known complexity of online lowest common ancestor search to O(log h) persistently, and without preprocessing -
edit-distance-linear
Levenshtein edit distance in linear memory (also turns out to be faster than C++)
InfluxDB - Power Real-Time Data Analytics at Scale
* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest.
Do you think we are missing an alternative of jps or a related project?
README
jps -- jump point search for Haskell
| Hackage
Dedication
People take the longest possible paths, digress to numerous dead ends, and make all kinds of mistakes.Then historians come along and write summaries of this messy, nonlinear process and make it appear like a simple, straight line.
Dean Kamen
Overview
Jump point search is a variant of A* that cuts down on the search space by assuming you always want to continue in a straight line. As such, it runs remarkably faster on graphs that are mostly open.
For a fantastic introduction to how the algorithm works, check out zerowidth positive lookahead's excellent explanation.
jps
is a Haskell implementation of jump point search. It was originally
written by Zachary Kamerling and is maintained by Sandy
Maguire.