We have collection of more than 1 Million open source products ranging from Enterprise product to small libraries in all platforms. We aggregate information from all open source repositories. Search and find the best for your needs. Check out projects section.
easystarjs - An asynchronous A* pathfinding API written in 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.
grid asynchronous pathfinding easystar astar game a*PathFinding.js - A comprehensive path-finding library for grid based games
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.
pathfinding astar dijkstra game algorithm jumppoint depthfirst breadthfirstngraph.path - Path finding in a graph
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.
graph pathfinder heuristic heap finder algorithm ngraph path find astar a-star pathfindingvalhalla - Open Source Routing Engine for OpenStreetMap
Valhalla is an open source routing engine and accompanying libraries for use with OpenStreetMap data. Valhalla also includes tools like time+distance matrix computation, isochrones, elevation sampling, map matching and tour optimization (Travelling Salesman). Technical documentation for the various components of the library can be found here: docs. Service API documentation as well as links to a variety of technical descriptions are provided within the valhalla-docs repository.
openstreetmap dijkstra astar tiled directions isochrones multi-modal traveling-salesman routing-enginel1-path-finder - 🗺 Fast path planning for 2D grids
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.
path dijkstra astar a* grid shortest plan a star rectilinear orthogonal l1 optimal game search plannernode-path-finding - a simple server-side path finding module for NodeJS
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
algorithm game astar grid movement multiplayer pathfindingthree-pathfinding - Navigation mesh utilities for three.js, based on PatrolJS.
Navigation mesh toolkit for ThreeJS, based on PatrolJS. Computes paths between points on a 3D nav mesh, supports multiple zones, and clamps movement vectors for FPS controls. To learn how to create a navigation mesh using Blender, see Creating a Nav Mesh. Thanks to Nick Janssen for creating PatrolJS, which was the basis for this library.
patrol patroljs patrol.js three three.js threejs pathfinding aframe astar nav navmesh navigationconstellation.js - A grid geometry toolkit for A* pathfinding and 2D sprite motion.
A grid geometry toolkit for controlling 2D sprite motion. While Constellation is not an animation library itself, it's designed to work hand-in-hand with animation tools such as jQuery, TweenLite, or TweenJS (to name a few). Use Constellation to manage and search across grid geometry, then feed its points into your preferred animation library.
geometry grid astar a-star pathfinding animationPatrolJS - Navigation mesh toolkit for ThreeJS
PatrolJS helps your AI agents navigate around your world. It uses the A* and Funnel algorithms to calculate a path on a navigation mesh. Traditionally games and 3D apps used waypoints to help their AI agents navigate. This is bad and has a lot of problems, but is generally easier to implement than navigation meshes. Navmeshes are far more accurate, faster and take into account the size of the AI agent (e.g. tanks require move space to maneuver than soldiers).
patrol patroljs patrol.js three three.js threejs pathfinding astar nav navmesh navigationlinq-to-astar - LINQ as query expression against heuristic algorithms
LINQ to A* is an experimental library aimed to incorporate LINQ expressions into A* as well as other heuristic search algorithms. With the library, LINQ can now be used as query expression to state conditions and fetch path found by the algorithm. The library defines a set of generic APIs that can be applied to any problem as long as the problem can be solved with the algorithm. By taking advantage of the power of LINQ, the library is not only about re-implementing in C#, but also giving new ability and flexibility to the algorithms.
dotnet-core dotnetstandard heuristic-algorithm best-first-search iterative-deepening-search astar pathfinding 8-puzzle
We have large collection of open source products. Follow the tags from
Tag Cloud >>
Open source products are scattered around the web. Please provide information
about the open source projects you own / you use.
Add Projects.
