Search Results for "pathfinding"

ngraph.path is a JavaScript library that implements efficient pathfinding algorithms for graphs, primarily designed to compute shortest paths in weighted or unweighted networks. It provides a clean API for constructing graph models, assigning weights to edges, and querying for optimal routes between nodes, making it useful for routing, games, maps, and network optimization. The library includes several algorithm implementations such as A*, Dijkstra’s, and breadth-first search, each suited to different types of graph structure and performance needs. ...

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. It comes along with an online demo to show how the algorithms execute. (The pathfinding speed is slowed down in the demo). 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. When instantiating path-finders, you may pass in additional parameters to indicate which specific strategies to use. For all path-finders, you may indicate whether diagonal movement is allowed. ...

ROguelike Toolkit in JavaScript. Cool dungeon-related stuff, interactive manual, documentation, tests.