node-path-finding - a simple server-side path finding module for NodeJS

  •        9

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

https://github.com/yi/node-path-finding

Tags
Implementation
License
Platform

   




Related Projects

PathFinding.js - A comprehensive path-finding library for grid based games

  •    Javascript

The aim of this project is to provide a path-finding library that can be easily incorporated into web games. It may run on Node.js or the browser. Note that this project only provides path-finding algorithms for 2D space. If you need to work in a 3D environment, then you may use @schteppe's fork.

AStar Sample WPF Application by Ben Scharbach

  •    DotNet

The A* Pathfinding component contains an A* Manager, with three A* path finding engines, allowing for 3 simultaneous path searches on PC and XBOX. - By Ben

ngraph.path - Path finding in a graph

  •    Javascript

Fast path finding for arbitrary graphs. Play with a demo or watch it on YouTube. If you want to learn how the demo was made, please refer to the demo's source code. I tried to describe it in great details.

easystarjs - An asynchronous A* pathfinding API written in Javascript.

  •    Javascript

easystar.js is an asynchronous A* pathfinding API written in Javascript for use in your HTML5 games and interactive projects. The goal of this project is to make it easy and fast to implement performance conscious pathfinding.First create EasyStar.

Hex-Grid Utilities for Board Game Developers

  •    

A tool kit of utilities for development of board- and strategy-games on a hexagonal grid, including custom coordinates. path-finding and elevated line-of-sight


SOTA-Py - A discrete-time Python-based solver for the Stochastic On-Time Arrival routing problem

  •    Python

SOTA-Py is a Python-based solver for the policy- and path-based "SOTA" problems, using the algorithm(s) described in Tractable Pathfinding for the Stochastic On-Time Arrival Problem (also in the corresponding arXiv preprint) and previous works referenced therein. What is the SOTA problem? Read on...

javascript-astar - A* Search / Pathfinding Algorithm in Javascript

  •    Javascript

A* Search / Pathfinding Algorithm in Javascript

l1-path-finder - 🗺 Fast path planning for 2D grids

  •    Javascript

A fast path planner for grids. The input to the library is in the form of an ndarray. For more information on this data type, check out the SciJS project.

Argorha pathfinding

  •    C++

Argorha Pathfinding is an algorithm which permit you to find your way into a polygon soup ( 3D world ) efficently by precalculating a system of sectors and portals. AStar included. Demo in Download section, code on SVN.

DEngine - C# XNA 2D Game Engine

  •    

A 2D game engine written in C# and XNA. Features animated sprite capability and physics simulation by FarseerPhysics. Includes a level editor, a GUI controls library and a sample RTS game, Factions. Contains A* pathfinding for unit movement and an ants system for AI navigation.

pathfinding with depth first search, breadth first search and astar search

  •    

pathfinding with depth first search, breadth first search and astar search for c++ console mode

PathFinding.js - A comprehensive path-finding library for grid based games

  •    Javascript

A comprehensive path-finding library for grid based games

dijkstras-algorithm - Implementations of Dijkstra's shortest path algorithm in different languages

  •    Java

Implementations of Dijkstra's shortest path algorithm in different languages. Head over to http://maxburstein.com/blog/introduction-to-graph-theory-finding-shortest-path/ to learn about implementing Dijkstra's algorithm. You can also learn about unit testing by visiting http://maxburstein.com/blog/introduction-to-unit-testing-in-python-and-ruby/.

polylabel - A fast algorithm for finding the pole of inaccessibility of a polygon (in JavaScript and C++)

  •    C++

A fast algorithm for finding polygon pole of inaccessibility, the most distant internal point from the polygon outline (not to be confused with centroid), implemented as a JavaScript library. Useful for optimal placement of a text label on a polygon.This is an iterative grid-based algorithm, which starts by covering the polygon with big square cells and then iteratively splitting them in the order of the most promising ones, while aggressively pruning uninteresting cells.

yi - The Haskell-Scriptable Editor

  •    Haskell

Yi is a collection of packages that serve as building blocks for making your very own text editor. Just running stack install yi or cabal install -j yi would be akin to unwrapping a box of lego and finding an assembled spaceship there. Note that this way, it will not be possible to use a custom configuration.

phaser-multiplayer-game - :video_game: Simple real-time multiplayer phaser game example which uses node and websockets

  •    Javascript

Simple real-time multiplayer phaser game which uses node and websockets. And derived from the Phaser's tanks example game.

gdx-ai - Artificial Intelligence framework for games based on libGDX or not

  •    Java

An artificial intelligence framework, entirely written in Java, for game development with libGDX.The gdxAI project is a libGDX extension living under the libGDX umbrella. However it does not force you to use that specific framework if you do not wish to do so. The libGDX jar remains an essential requirement, mostly due to the use of libGDX collections which are optimized for mobile platforms by limiting garbage creation and supporting primitive types directly, so avoiding boxing and unboxing.

Wireless Routing using Dijkstra's Shortest Path Algorithm

  •    

Explains Dijkstra's shortest path algorithm, for wireless network routing. The users can create a random map with dynamic transmission range and choose a source and destination mobile node (by clicking) in the map and see the shortest path visually in the Silverlight output.

Rippled - Decentralized cryptocurrency blockchain daemon implementing the XRP Ledger in C++

  •    C++

Ripple is a network of computers which use the Ripple consensus algorithm to atomically settle and record transactions on a secure distributed database, the Ripple Consensus Ledger (RCL). Because of its distributed nature, the RCL offers transaction immutability without a central operator. The RCL contains a built-in currency exchange and its path-finding algorithm finds competitive exchange rates across order books and currency pairs.

AncientBeast - 🐺 Turn Based Strategy Game. Master your beasts!

  •    Javascript

The project is developed with the use of free open source cross platform applications and freeware services. Mega comes in very handy when working on the game assets collaboratively, while GitHub handles the code part and stores the final assets. Art contributions can be made as well in our deviantArt group. Drop by our Discord chat and be a part of the community! Blender is being used for creating most of the assets, such as combat locations, creatures and their own animations, which are rendered into sprites that are usually made into sprite-sheets using our Spritify add-on, as well as for many other tasks. Krita, Gimp and MyPaint are useful for concept art, while Inkscape is useful for creating the vector creature ability icons.