mikolalysenko/l1-path-finder

Better binary searching

Multidimensional Arrays

Common operations for ndarray arrays

Exactly computes the orientation of a tuple of points

Removes duplicates from a sorted array in place

Get the quickest, most high-resolution timestamp possible in node or the browser

tap-producing test harness for node and browsers

Extracts the boundary of a binary 2D image

Computes a prefix sum of an ndarray

Andrea Giammarchi's path finder with A* (A star).

Partitions a 2D binary image into rectangles

Great looking color maps

Asynchronous A* Pathfinding API

Mouse state change listener

Displays an ndarray as an image

Converts an ndarray into an array-of-arrays

a Node.JS implementation for AStar path finding algorithm. This implementation uses primitive data types (Number and Byte/Buffer) to present location and block data that significantly improve the speed and have a good control on memory consumption

Parses grid path finding benchmark data

nothin but nets. http client that works in node and browsers

Comprehensive pathfinding library for grid based games

Randomize the order of the elements in a given array.