mikolalysenko/l1-path-finder

Multidimensional Arrays

Common operations for ndarray arrays

Exactly computes the orientation of a tuple of points

Removes duplicates from a sorted array in place

Partitions a 2D binary image into rectangles

Converts an ndarray into an array-of-arrays

tap-producing test harness for node and browsers

Better binary searching

Extracts the boundary of a binary 2D image

Computes a prefix sum of an ndarray

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

Great looking color maps

Mouse state change listener

Displays an ndarray as an image

Asynchronous A* Pathfinding API

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

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

Comprehensive pathfinding library for grid based games

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

Randomize the order of the elements in a given array.